Product location, allocation and server home base location for an order picking line with multiple servers

Elizabeth Jewkes, Chul Ung Lee, Ray Vickson

Research output: Contribution to journalArticle

32 Citations (Scopus)

Abstract

In this paper, we are interested in several interrelated control issues for a 'pick to order' (or, 'strict' order picking) picking line which stores N = nk types of products in n bins, each with k shelves. To fill each order, a container is transported past the various locations containing products, and the appropriate quantity of each product is removed from its respective storage location and put into the order container using an 'out and back' picking strategy. Each of several pickers is assigned a set or 'zone' of products. We are interested in the concurrent problems of. (1) product location, (2) picker home base location, and (3) allocating products to each picker so that the expected order cycle time is minimized. We provide easily implemented algorithms to solve these problems and are able to show that the results apply for several alternate picking strategies. For fixed product locations, we develop an efficient dynamic programming algorithm which determines the optimal product allocation and server locations.

Original languageEnglish
Pages (from-to)623-636
Number of pages14
JournalComputers and Operations Research
Volume31
Issue number4
DOIs
Publication statusPublished - 2004 Apr 1
Externally publishedYes

Fingerprint

Order picking
Location-allocation
Servers
Server
Line
Containers
Container
Bins
Dynamic programming
Alternate
Dynamic Programming
Concurrent
programming

Keywords

  • Order picking
  • Product location
  • Server location
  • Warehousing
  • Zoning

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

Product location, allocation and server home base location for an order picking line with multiple servers. / Jewkes, Elizabeth; Lee, Chul Ung; Vickson, Ray.

In: Computers and Operations Research, Vol. 31, No. 4, 01.04.2004, p. 623-636.

Research output: Contribution to journalArticle

@article{374915b46eba42f7bce3791a67906aa6,
title = "Product location, allocation and server home base location for an order picking line with multiple servers",
abstract = "In this paper, we are interested in several interrelated control issues for a 'pick to order' (or, 'strict' order picking) picking line which stores N = nk types of products in n bins, each with k shelves. To fill each order, a container is transported past the various locations containing products, and the appropriate quantity of each product is removed from its respective storage location and put into the order container using an 'out and back' picking strategy. Each of several pickers is assigned a set or 'zone' of products. We are interested in the concurrent problems of. (1) product location, (2) picker home base location, and (3) allocating products to each picker so that the expected order cycle time is minimized. We provide easily implemented algorithms to solve these problems and are able to show that the results apply for several alternate picking strategies. For fixed product locations, we develop an efficient dynamic programming algorithm which determines the optimal product allocation and server locations.",
keywords = "Order picking, Product location, Server location, Warehousing, Zoning",
author = "Elizabeth Jewkes and Lee, {Chul Ung} and Ray Vickson",
year = "2004",
month = "4",
day = "1",
doi = "10.1016/S0305-0548(03)00035-2",
language = "English",
volume = "31",
pages = "623--636",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "4",

}

TY - JOUR

T1 - Product location, allocation and server home base location for an order picking line with multiple servers

AU - Jewkes, Elizabeth

AU - Lee, Chul Ung

AU - Vickson, Ray

PY - 2004/4/1

Y1 - 2004/4/1

N2 - In this paper, we are interested in several interrelated control issues for a 'pick to order' (or, 'strict' order picking) picking line which stores N = nk types of products in n bins, each with k shelves. To fill each order, a container is transported past the various locations containing products, and the appropriate quantity of each product is removed from its respective storage location and put into the order container using an 'out and back' picking strategy. Each of several pickers is assigned a set or 'zone' of products. We are interested in the concurrent problems of. (1) product location, (2) picker home base location, and (3) allocating products to each picker so that the expected order cycle time is minimized. We provide easily implemented algorithms to solve these problems and are able to show that the results apply for several alternate picking strategies. For fixed product locations, we develop an efficient dynamic programming algorithm which determines the optimal product allocation and server locations.

AB - In this paper, we are interested in several interrelated control issues for a 'pick to order' (or, 'strict' order picking) picking line which stores N = nk types of products in n bins, each with k shelves. To fill each order, a container is transported past the various locations containing products, and the appropriate quantity of each product is removed from its respective storage location and put into the order container using an 'out and back' picking strategy. Each of several pickers is assigned a set or 'zone' of products. We are interested in the concurrent problems of. (1) product location, (2) picker home base location, and (3) allocating products to each picker so that the expected order cycle time is minimized. We provide easily implemented algorithms to solve these problems and are able to show that the results apply for several alternate picking strategies. For fixed product locations, we develop an efficient dynamic programming algorithm which determines the optimal product allocation and server locations.

KW - Order picking

KW - Product location

KW - Server location

KW - Warehousing

KW - Zoning

UR - http://www.scopus.com/inward/record.url?scp=0347900471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347900471&partnerID=8YFLogxK

U2 - 10.1016/S0305-0548(03)00035-2

DO - 10.1016/S0305-0548(03)00035-2

M3 - Article

AN - SCOPUS:0347900471

VL - 31

SP - 623

EP - 636

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 4

ER -