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

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

Keywords

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

Fingerprint Dive into the research topics of 'On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations'. Together they form a unique fingerprint.

Cite this