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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
