On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations

J. Ashayeri, R.M.J. Heuts, M. Beekhof, M.R. Wilhelm

Research output: Working paperDiscussion paperOther research output

357 Downloads (Pure)

Abstract

This paper presents the use and extension of a geometrical-based algorithmic approach for determining the expected S/R machine cycle times, and therefore warehouse throughput, for class-based storage assignment layouts in an AS/RS.The approach was designed for the purpose of solving a practical storage assignment design problem for a major European manufacturer.The algorithm may be used to layout racks that are either "square-in-time (SIT)" or "non-square in time (NSIT)" with single or multiple I/O points.It is believed that use of this approach can result in the expedient evaluation of warehouse throughput resulting from new layouts, or re-layouts, of AS/R system racks, thus making these systems more appealing for use in integrated supply chain systems in general.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages15
Volume2001-68
Publication statusPublished - 2001

Publication series

NameCentER Discussion Paper
Volume2001-68

Fingerprint

Warehouses
Throughput
Supply chains

Keywords

  • production management
  • manufacturing
  • supply chain mangement
  • warehousing
  • storage

Cite this

Ashayeri, J., Heuts, R. M. J., Beekhof, M., & Wilhelm, M. R. (2001). On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations. (CentER Discussion Paper; Vol. 2001-68). Tilburg: Operations research.
Ashayeri, J. ; Heuts, R.M.J. ; Beekhof, M. ; Wilhelm, M.R. / On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations. Tilburg : Operations research, 2001. (CentER Discussion Paper).
@techreport{89ac4eda9e9e418da96628831ff22753,
title = "On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations",
abstract = "This paper presents the use and extension of a geometrical-based algorithmic approach for determining the expected S/R machine cycle times, and therefore warehouse throughput, for class-based storage assignment layouts in an AS/RS.The approach was designed for the purpose of solving a practical storage assignment design problem for a major European manufacturer.The algorithm may be used to layout racks that are either {"}square-in-time (SIT){"} or {"}non-square in time (NSIT){"} with single or multiple I/O points.It is believed that use of this approach can result in the expedient evaluation of warehouse throughput resulting from new layouts, or re-layouts, of AS/R system racks, thus making these systems more appealing for use in integrated supply chain systems in general.",
keywords = "production management, manufacturing, supply chain mangement, warehousing, storage",
author = "J. Ashayeri and R.M.J. Heuts and M. Beekhof and M.R. Wilhelm",
note = "Pagination: 15",
year = "2001",
language = "English",
volume = "2001-68",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Ashayeri, J, Heuts, RMJ, Beekhof, M & Wilhelm, MR 2001 'On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations' CentER Discussion Paper, vol. 2001-68, Operations research, Tilburg.

On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations. / Ashayeri, J.; Heuts, R.M.J.; Beekhof, M.; Wilhelm, M.R.

Tilburg : Operations research, 2001. (CentER Discussion Paper; Vol. 2001-68).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations

AU - Ashayeri, J.

AU - Heuts, R.M.J.

AU - Beekhof, M.

AU - Wilhelm, M.R.

N1 - Pagination: 15

PY - 2001

Y1 - 2001

N2 - This paper presents the use and extension of a geometrical-based algorithmic approach for determining the expected S/R machine cycle times, and therefore warehouse throughput, for class-based storage assignment layouts in an AS/RS.The approach was designed for the purpose of solving a practical storage assignment design problem for a major European manufacturer.The algorithm may be used to layout racks that are either "square-in-time (SIT)" or "non-square in time (NSIT)" with single or multiple I/O points.It is believed that use of this approach can result in the expedient evaluation of warehouse throughput resulting from new layouts, or re-layouts, of AS/R system racks, thus making these systems more appealing for use in integrated supply chain systems in general.

AB - This paper presents the use and extension of a geometrical-based algorithmic approach for determining the expected S/R machine cycle times, and therefore warehouse throughput, for class-based storage assignment layouts in an AS/RS.The approach was designed for the purpose of solving a practical storage assignment design problem for a major European manufacturer.The algorithm may be used to layout racks that are either "square-in-time (SIT)" or "non-square in time (NSIT)" with single or multiple I/O points.It is believed that use of this approach can result in the expedient evaluation of warehouse throughput resulting from new layouts, or re-layouts, of AS/R system racks, thus making these systems more appealing for use in integrated supply chain systems in general.

KW - production management

KW - manufacturing

KW - supply chain mangement

KW - warehousing

KW - storage

M3 - Discussion paper

VL - 2001-68

T3 - CentER Discussion Paper

BT - On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations

PB - Operations research

CY - Tilburg

ER -

Ashayeri J, Heuts RMJ, Beekhof M, Wilhelm MR. On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations. Tilburg: Operations research. 2001. (CentER Discussion Paper).