Order picking in carousel systems under the nearest item heuristic

Share/Save/Bookmark

Litvak, N. and Adan, I.J.B.F. and Wessels, J. and Zijm, W.H.M. (2001) Order picking in carousel systems under the nearest item heuristic. Probability in the Engineering and Informational Sciences, 15 (2). pp. 135-164. ISSN 0269-9648

[img]PDF
Restricted to UT campus only
: Request a copy
475Kb
Abstract:A carousel is a computer-controlled warehousing system, which is widely used to store small- and medium-sized goods. One of the most important performance characteristics of such systems is the pick time of an order, which mostly depends on the travel time of the carousel. In this article, we consider some reasonable heuristics for order picking. In particular, we establish properties of the Nearest Item (NI) heuristic. This one is frequently used in practice. We derive tight upper bounds for the travel time under the NI heuristic and closed-form expressions for its mean and variance. We also present a simple two-moment approximation for the distribution of the travel time. In addition, we find the mean, variance, and distribution for the number of turns.
Item Type:Article
Copyright:© 2001 Cambridge University Press
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/71592
Official URL:http://dx.doi.org/10.1017/S0269964801152010
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 201328