Ronald J. Mantel Peter C. Schuur Sunderesh S. Heragu
Abstract
This paper deals with a new strategy for the assignment of Stock Keeping Units (SKUs) to storage locations in a warehouse, called Order Oriented Slotting (OOS). Given an empty warehouse, a set of orders to be picked and a routing policy, OOS stores the SKUs in such a way that the total time needed to pick all the orders is minimised. Unlike the Cube per Order Index (COI) slotting strategy which stores an item based on how frequently it is picked without regard to picking sequences, OOS aims to store items, that appear together in orders, close to each other. OOS can be formulated as an Integer Linear Programming model when the routing is S-shaped and when a Vertical Lift Module (VLM) is adopted. Given the computational complexity of the problem, we present several heuristics. Their performance is compared through a set of VLM test problems with different order characteristics. [Received 7 November 2006; Revised 17 March 2007; Accepted 18 May 2007]
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.