We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A Set-based Scheduling Problem for Square Rack Automated Storage and Retrieval Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lee, H.F. ; Ind. & Manuf. Eng., Southern Illinois Univ., Edwardsville, IL ; Eunyong Chung

Many researchers have studied AS/RS scheduling problems that sequence the storage and retrieval requests to maximize 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 not with a specific bin position but with a specific product item which is available in various bin locations. In this paper, we address a generalized 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 derive the cycle time distributions and their mean values for the single command under both squared and non-squared rack shapes

Published in:

Service Operations and Logistics, and Informatics, 2006. SOLI '06. IEEE International Conference on

Date of Conference:

21-23 June 2006