On a class of order pick strategies in paternosters

Nelli Litvak, Ivo Adan

Research output: Contribution to journalArticleAcademicpeer-review

12 Citations (Scopus)
1 Downloads (Pure)


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 languageUndefined
Article number10.1016/S0167-6377(02)00154-2
Pages (from-to)377-386
Number of pages10
JournalOperations research letters
Issue number6
Publication statusPublished - Dec 2002


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

Cite this