On Sequencing Retrievals In An Automated Storage/Retrieval System

Publisher Website
Google Scholar
Abstract
This paper addresses throughput improvement by retrieval sequencing in conventional unit load automated storage/retrieval systems when several retrieval requests are available and dual command cycles are performed. Taking first-come-first-served as the reference sequencing rule, the potential for improvement is identified. A “nearest-neighbor” sequencing rule is proposed as an alternative, an analytic model for its expected performance is developed, and Monte Carlo simulation is used for evaluation. In addition, a lower bound on dual command cycle times is developed, and the dynamic behavior of two heuristic sequencing rules is discussed.