Misc,

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

, , , and .
(01.01.2001)

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.

Tags

Users

  • @slauck

Comments and Reviews