Order picking in carousel systems under the nearest item heuristic

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

Research output: Book/ReportReportProfessional

59 Downloads (Pure)

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 paper 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 of the number of turns.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages31
ISBN (Print)0169-2690
Publication statusPublished - 2000

Publication series

NameMemorandum / Faculty of Mathematical Sciences
PublisherDepartment of Applied Mathematics, University of Twente
No.1523
ISSN (Print)0169-2690

Keywords

  • EWI-3343
  • IR-65711
  • METIS-141218
  • MSC-90B05

Cite this

Litvak, N., Adan, I. J. B. F., Wessels, J., & Zijm, W. H. M. (2000). Order picking in carousel systems under the nearest item heuristic. (Memorandum / Faculty of Mathematical Sciences; No. 1523). Enschede: University of Twente, Department of Applied Mathematics.
Litvak, Nelli ; Adan, I.J.B.F. ; Wessels, J. ; Zijm, Willem H.M. / Order picking in carousel systems under the nearest item heuristic. Enschede : University of Twente, Department of Applied Mathematics, 2000. 31 p. (Memorandum / Faculty of Mathematical Sciences; 1523).
@book{2672904a15084a0791f4c396c95e6991,
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 paper 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 of the number of turns.",
keywords = "EWI-3343, IR-65711, METIS-141218, MSC-90B05",
author = "Nelli Litvak and I.J.B.F. Adan and J. Wessels and Zijm, {Willem H.M.}",
note = "Imported from MEMORANDA",
year = "2000",
language = "Undefined",
isbn = "0169-2690",
series = "Memorandum / Faculty of Mathematical Sciences",
publisher = "University of Twente, Department of Applied Mathematics",
number = "1523",

}

Litvak, N, Adan, IJBF, Wessels, J & Zijm, WHM 2000, Order picking in carousel systems under the nearest item heuristic. Memorandum / Faculty of Mathematical Sciences, no. 1523, University of Twente, Department of Applied Mathematics, Enschede.

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

Enschede : University of Twente, Department of Applied Mathematics, 2000. 31 p. (Memorandum / Faculty of Mathematical Sciences; No. 1523).

Research output: Book/ReportReportProfessional

TY - BOOK

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

AU - Litvak, Nelli

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

AU - Wessels, J.

AU - Zijm, Willem H.M.

N1 - Imported from MEMORANDA

PY - 2000

Y1 - 2000

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 paper 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 of 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 paper 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 of the number of turns.

KW - EWI-3343

KW - IR-65711

KW - METIS-141218

KW - MSC-90B05

M3 - Report

SN - 0169-2690

T3 - Memorandum / Faculty of Mathematical Sciences

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

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -

Litvak N, Adan IJBF, Wessels J, Zijm WHM. Order picking in carousel systems under the nearest item heuristic. Enschede: University of Twente, Department of Applied Mathematics, 2000. 31 p. (Memorandum / Faculty of Mathematical Sciences; 1523).