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.
Ghosh, J. B., & Wells, C. E. (1992). Optimal retrieval strategies for carousel conveyors. Mathematical and Computer Modelling, 16(10), 59–70. https://doi.org/10.1016/0895-7177(92)90060-X