Order picking in carousel systems under the nearest item heuristic

Nelli Litvak, Willem H.M. Zijm, I.J.B.F. Adan, J. Wessels

Research output: Contribution to journalArticleAcademicpeer-review

12 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)135-164
JournalProbability in the engineering and informational sciences
Volume15
Issue number2
DOIs
Publication statusPublished - 2001

Fingerprint

Order picking
Travel Time
Travel time
Heuristics
Closed-form
Upper bound
Moment
Approximation

Keywords

  • METIS-201328
  • IR-71592

Cite this

@article{50046b51717a41fdaaa80d0dd9af6ac5,
title = "Order picking in carousel systems under the nearest item heuristic",
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.",
keywords = "METIS-201328, IR-71592",
author = "Nelli Litvak and Zijm, {Willem H.M.} and I.J.B.F. Adan and J. Wessels",
year = "2001",
doi = "10.1017/S0269964801152010",
language = "English",
volume = "15",
pages = "135--164",
journal = "Probability in the engineering and informational sciences",
issn = "0269-9648",
publisher = "Cambridge University Press",
number = "2",

}

Order picking in carousel systems under the nearest item heuristic. / Litvak, Nelli; Zijm, Willem H.M.; Adan, I.J.B.F.; Wessels, J.

In: Probability in the engineering and informational sciences, Vol. 15, No. 2, 2001, p. 135-164.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Order picking in carousel systems under the nearest item heuristic

AU - Litvak, Nelli

AU - Zijm, Willem H.M.

AU - Adan, I.J.B.F.

AU - Wessels, J.

PY - 2001

Y1 - 2001

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

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

KW - METIS-201328

KW - IR-71592

U2 - 10.1017/S0269964801152010

DO - 10.1017/S0269964801152010

M3 - Article

VL - 15

SP - 135

EP - 164

JO - Probability in the engineering and informational sciences

JF - Probability in the engineering and informational sciences

SN - 0269-9648

IS - 2

ER -