On a class of order pick strategies in paternosters

Nelli Litvak; Ivo Adan

doi:10.1016/S0167-6377(02)00154-2

On a class of order pick strategies in paternosters

Nelli Litvak, Ivo Adan

Stochastic Operations Research

Research output: Contribution to journal › Article › Academic › peer-review

12 Citations (Scopus)

7 Downloads (Pure)

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.

Original language	Undefined
Article number	10.1016/S0167-6377(02)00154-2
Pages (from-to)	377-386
Number of pages	10
Journal	Operations research letters
Volume	30
Issue number	6
DOIs	https://doi.org/10.1016/S0167-6377(02)00154-2
Publication status	Published - Dec 2002

Keywords

Travel time distribution
Uniform spacings
IR-71580
EWI-17939
METIS-207012
Warehousing systems

Access to Document

10.1016/S0167-6377(02)00154-2

http://eprints.eemcs.utwente.nl/secure2/17939/01/2002-19LitvakAdan.pdf

Cite this

@article{6d5d540cc958414e8a2c00a21a5410b5,

title = "On a class of order pick strategies in paternosters",

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.",

keywords = "Travel time distribution, Uniform spacings, IR-71580, EWI-17939, METIS-207012, Warehousing systems",

author = "Nelli Litvak and Ivo Adan",

year = "2002",

month = dec,

doi = "10.1016/S0167-6377(02)00154-2",

language = "Undefined",

volume = "30",

pages = "377--386",

journal = "Operations research letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - On a class of order pick strategies in paternosters

AU - Litvak, Nelli

AU - Adan, Ivo

PY - 2002/12

Y1 - 2002/12

N2 - 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.

AB - 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.

KW - Travel time distribution

KW - Uniform spacings

KW - IR-71580

KW - EWI-17939

KW - METIS-207012

KW - Warehousing systems

U2 - 10.1016/S0167-6377(02)00154-2

DO - 10.1016/S0167-6377(02)00154-2

M3 - Article

SN - 0167-6377

VL - 30

SP - 377

EP - 386

JO - Operations research letters

JF - Operations research letters

IS - 6

M1 - 10.1016/S0167-6377(02)00154-2

ER -