Volltext-Downloads (blau) und Frontdoor-Views (grau)

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

  • 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.

Export metadata

Additional Services

Search Google Scholar


Document Type:Article
Author:Dominik KressORCiD, Erwin PeschORCiD
Center:Center for Advanced Studies in Management (CASiM)
Year of Completion:2017
In: IISE Transactions, 49 (2017) 1, 13-30 DOI 10.1080/0740817X.2016.1213469