Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T12:04:14.056Z Has data issue: false hasContentIssue false

The travel time in carousel systems under the nearest item heuristic

Published online by Cambridge University Press:  14 July 2016

Nelly Litvak*
Affiliation:
EURANDOM
Ivo Adan*
Affiliation:
Eindhoven University of Technology
*
∗ Postal address: EURANDOM, PO Box 513, 5600 MB, Eindhoven, The Netherlands. Email address: litvak@eurandom.tue.nl
∗∗ Postal address: Department of Mathematics and Computing Science, Eindhoven University of Technology, PO Box 513, 5600 MB, Eindhoven, The Netherlands.

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.

Information

Type
Research Papers
Copyright
Copyright © by the Applied Probability Trust 2001 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable