Abstract
A carousel is an automated warehousing system consisting of a large number of drawers rotating in a closed loop. In this paper, we study the travel time needed to pick a list of items when the carousel operates under the nearest item heuristic. We find a closed form expression for the distribution and all moments of the travel time. We also analyse the asymptotic behaviour of the travel time when the number of items tends to infinity. All results follow from probabilistic arguments based on properties of uniform order statistics.
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.
