Optimal retrieval strategies for carousel conveyors

Abstract

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. © 1992.