A generalised sequencing problem for unit-load automated storage and retrieval systems Online publication date: Wed, 11-Apr-2007
by Eunyong Chung, H. Felix Lee
International Journal of Industrial and Systems Engineering (IJISE), Vol. 2, No. 4, 2007
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook