In this paper, we are interestedin

in this paper, we are interestedin several interrelatedcontrol 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 2ll each order,
a container is transportedpast the various locations containing products, andthe appropriate quantity of each
.product is removedfrom its respective storage location andput into the order container using an 'out and
back' picking strategy. each of several pickers is assigneda set or 'zone' of products. we are interestedin
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 andare able to show that the results apply for several alternate picking strategies.
for 2xed product locations, we develop an e8cient dynamic programming algorithm which determines the
optimal product allocation and server locations.
? 2003 elsevier ltd. all rights reserved.
keywords: warehousing; order picking; product location;server location; zoning.

In this paper, we are interestedin several interrelatedcontrol 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 2ll each order,
a container is transportedpast the various locations containing products, andthe appropriate quantity of each
product is removedfrom its respective storage location andput into the order container using an 'out and
back' picking strategy. Each of several pickers is assigneda set or 'zone' of products. We are interestedin
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 andare able to show that the results apply for several alternate picking strategies.
For 2xed product locations, we develop an e8cient dynamic programming algorithm which determines the
optimal product allocation and server locations.
? 2003 Elsevier Ltd. All rights reserved.
Keywords: Warehousing; Order picking; Product location; Server location; Zoning

This paper In, we are interestedin interrelatedcontrol several issues for a pick to 'Order' (or, 'strict'
Order picking) picking line which stores N = nk n types of products in bins, each with K shelves. To 2ll each order,
a container is the transportedpast products containing various locations, andthe appropriate quantity of each
Product is removedfrom its respective storage location andput into the container using an order 'out and Back'
picking strategy.Each of several pickers is assigneda set or 'zone' of products. We are interestedin
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 andare able to show that the results apply for several alternate picking strategies.
For 2 xed product locations, we develop an E cient 8 dynamic programming algorithm which determines the optimal
product allocation and server locations.
2003 Elsevier Ltd? .All rights reserved.
Keywords: Warehousing ; Order picking; Product location;Server Location; Zoning