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

Authors:
Elizabeth Jewkes;Chulung Lee;Ray Vickson
Affiliations:
Department of Management Sciences, University of Waterloo, Waterloo, Ont., Canada N2L 3G1;Department of Industrial and Systems Engineering, National University of Singapore, Singapore 119260, Singapore;Department of Management Sciences, University of Waterloo, Waterloo, Ont., Canada N2L 3G1
Venue:
Computers and Operations Research
Year:
2004

Citing 4
Cited 4

Disk arm movement in anticipation of future requests

ACM Transactions on Computer Systems (TOCS)
Note. Optimal Storage Assignment Policies for Automated Storage and Retrieval Systems with Stochastic Demands

Management Science
Placement of Records on a Secondary Storage Device to Minimize Access Time

Journal of the ACM (JACM)
On the Optimality of the Probability Ranking Scheme in Storage Applications

Journal of the ACM (JACM)

A simulation model to improve warehouse operations

Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
A particle swarm optimization algorithm for the multiple-level warehouse layout design problem

Computers and Industrial Engineering
A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system

Computers and Industrial Engineering
Improving the productivity of order picking of a manual-pick and multi-level rack distribution warehouse through the implementation of class-based storage

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

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.