An interleaving policy in automated storage/retrieval systems

An interleaving policy in automated storage/retrieval systems

0.00 Avg rating0 Votes
Article ID: iaor19931793
Country: United Kingdom
Volume: 31
Issue: 1
Start Page Number: 1
End Page Number: 18
Publication Date: Jan 1993
Journal: International Journal of Production Research
Authors: ,
Keywords: service
Abstract:

In order to improve their service level many automated storage/retrieval systems have adopted a dual command policy. In a dual command policy both storage and retrieval of pallets are done within one roundtrip of the crane. The expected travel time for a dual command policy is composed of two one-way travel time elements used for storage and retrieval, and an interleaving time element used for moving from a storage location to a retrieval location. In this study the authors apply the nearest-neighbour policy to a class-based warehouse in order to decrease the interleaving time. They develop the methodology for determining the interleaving time for both square and rectangular (time-wise) warehouses. The authors show that using the nearest-neighbour policy in a class-based environment can decrease the interleaving time, resulting in a significant increase in the total throughput.

Reviews

Required fields are marked *. Your email address will not be published.