Optimal retrieval strategies for carousel conveyors. (English) Zbl 0782.90031

Summary: This paper addresses the problem of optimal retrieval from a carousel conveyor. Algorithms are developed to find optimal retrieval strategies for both single and multiple orders. In the multiple order case, a dynamic programming solution is derived under a \(FIFO\) sequencing restriction. A bounding scheme is also proposed to make the solution procedure more efficient. It is further shown how the solution may be updated dynamically for incoming orders.


90B05 Inventory, storage, reservoirs
90C39 Dynamic programming
Full Text: DOI


[1] Bartholdi, J.; Platzman, L., Retrieval strategies for a carousel conveyor, IIE Transactions, 18, 166-173 (1986)
[2] Bellman, R., Dynamic Programming (1957), Princeton University Press: Princeton University Press Princeton, NJ · Zbl 0077.13605
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.