On a class of order pick strategies in paternosters


Litvak, Nelly and Adan, Ivo (2002) On a class of order pick strategies in paternosters. Operations Research Letters, 30 (6). pp. 377-386. ISSN 0167-6377

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:We study the travel time needed to pick n items in a paternoster, operating under the m-step strategy. This means that the paternoster chooses the shortest route among the ones that change direction at most once, and after collecting at most m items. For random pick positions, we find the distribution and moments of the travel time, provided n>2m. It appears that, already for m=2, the m-step strategy is very close to optimal, and better than the nearest item heuristic.
Item Type:Article
Copyright:© 2002 Elsevier
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/71580
Official URL:https://doi.org/10.1016/S0167-6377(02)00154-2
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 207012