Which items should be stored together? A basic partition problem to assign storage space in group-based storage systems

ABSTRACT We consider a basic partition problem that subdivides Stock Keeping Units (SKUs) into disjoint subsets, such that the minimum number of groups has to be accessed when retrieving a given order set under a pick-by-order policy. We formalize this SKU partition problem and show its applicability in a wide range of storage systems that are based on separating their storage space into groups of SKUs stored in separate areas; examples are carousel racks and mobile shelves. We analyze the computational complexity and propose two mathematical models for the problem under consideration. Furthermore, we present an ejection chain heuristic and a branch and bound procedure. We analyze these algorithms and the mathematical models in computational tests.

[1]  Tien-Hsiang Chang,et al.  Improvement order picking in mobile storage systems with a middle cross aisle , 2009 .

[2]  Hark Hwang,et al.  Class-based storage assignment policy in carousel system , 1994 .

[3]  Nelly Litvak,et al.  Optimal picking of large orders in carousel systems , 2006, Oper. Res. Lett..

[4]  Erwin Pesch,et al.  Fast Clustering Algorithms , 1994, INFORMS J. Comput..

[5]  Christoph H. Glock,et al.  Storage policies and order picking strategies in U-shaped order-picking systems with a movable base , 2012 .

[6]  Raymond G. Vickson,et al.  Optimal storage locations in a carousel storage and retrieval system , 1996 .

[7]  Elkafi Hassini.  Storage space allocation to maximize inter-replenishment times , 2008, Comput. Oper. Res..

[8]  Nils Boysen,et al.  Part logistics in the automotive industry: Decision problems, literature review and research agenda , 2015, Eur. J. Oper. Res..

[9]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[10]  Bara Kim.  Maximizing service of carousel storage , 2005, Comput. Oper. Res..

[11]  Hark Hwang,et al.  An optimal boundary for two-class based storage assignment policy in carousel system , 1994 .

[12]  Nils Boysen,et al.  Sequencing of picking orders in mobile rack warehouses , 2017, Eur. J. Oper. Res..

[13]  Golgen Bengu.  An optimal storage assignment for automated rotating carousels , 1995 .

[14]  Nelly Litvak,et al.  A survey on performance analysis of warehouse carousel systems , 2008, 1404.5591.

[15]  Fred Glover,et al.  TSP Ejection Chains , 1997, Discret. Appl. Math..

[16]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[17]  Erwin Pesch,et al.  New bounds and constraint propagation techniques for the clique partitioning problem , 2013, Discret. Appl. Math..

[18]  Russell D. Meller,et al.  A throughput model for carousel/VLM pods , 2004 .

[19]  Hsin-Pin Fu,et al.  A two-sided picking model of M-AS/RS with an aisle-assignment algorithm , 2007 .

[20]  David Pokrass Jacobs,et al.  A simple heuristic for maximizing service of carousel storage , 2000, Comput. Oper. Res..

[21]  Layek Abdel-Malek,et al.  A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system , 1994, Comput. Oper. Res..

[22]  Nils Boysen,et al.  The deterministic product location problem under a pick-by-order policy , 2013, Discret. Appl. Math..

[23]  Marek Karpinski,et al.  Approximability of the Minimum Bisection Problem: An Algorithmic Challenge , 2002, MFCS.

[24]  Erwin Pesch,et al.  Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem , 2008, Transp. Sci..

[25]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[26]  Hark Hwang,et al.  Cycle time models for single/double carousel system , 1991 .