A generalised sequencing problem for unit-load automated storage and retrieval systems

Eunyong Chung and H. Felix Lee

International Journal of Industrial and Systems Engineering, 2007, vol. 2, issue 4, 393-412

Abstract: With continuing need for high throughput Automated Storage and Retrieval Systems (AS/RS), many researchers have studied a problem of sequencing storage and retrieval requests processed by the storage/retrieval machine to maximise the system throughput. These studies assume that each retrieval request is fixed with a pre-determined bin position in the AS/RS rack. However, in reality, a retrieval request is associated with a specific product item which is available in multiple bin locations. In this paper, we address a generalised sequencing problem that determines both specific bin locations for the retrieval requests and sequencing with the chosen bin locations. To solve this new complex combinatorial problem, we introduce heuristic methods and present their computational results. We also present the analytical cycle time distribution and mean value for the single command when an item of a retrieval request is available in multiple bin locations.

Keywords: automated storage; automated retrieval; AS/RS; retrieval sequencing; retrieval sets; throughput; travel time model. (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=13186 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:2:y:2007:i:4:p:393-412

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().