ORDER PICKING IN CAROUSEL SYSTEMS UNDER THE NEAREST ITEM HEURISTIC

Authors:
N. Litvak;I. J. B. F. Adan;J. Wessels;W. H. M. Zijm
Affiliations:
EURANDOM, Eindhoven, The Netherlands, E-mail: litvak@eurandom.tue.nl;Faculty of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, E-mail: i.j.b.f.adan@tue.nl/j.wessels@tue.nl;Faculty of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, E-mail: i.j.b.f.adan@tue.nl/j.wessels@tue.nl;Faculty of Applied Mathematics, University of Twente, Enschede, The Netherlands, E-mail: w.h.m.zijm@math.utwente.nl
Venue:
Probability in the Engineering and Informational Sciences
Year:
2001

Citing 1
Cited 4

Light-traffic analysis for queues with spatially distributed arrivals

Mathematics of Operations Research

PICKING CLUMPY ORDERS ON A CAROUSEL

Probability in the Engineering and Informational Sciences
Retrieval Strategies for Multi-tier Automated Carousel Conveyors with Multiple Robots

Simulation
Optimal picking of large orders in carousel systems

Operations Research Letters
On a class of order pick strategies in paternosters

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.