IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v49y2017i1p13-30.html
   My bibliography  Save this article

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

Author

Listed:
  • Dominik Kress
  • Nils Boysen
  • Erwin Pesch

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.

Suggested Citation

  • Dominik Kress & Nils Boysen & Erwin Pesch, 2017. "Which items should be stored together? A basic partition problem to assign storage space in group-based storage systems," IISE Transactions, Taylor & Francis Journals, vol. 49(1), pages 13-30, January.
    • Handle: RePEc:taf:uiiexx:v:49:y:2017:i:1:p:13-30
    DOI: 10.1080/0740817X.2016.1213469
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2016.1213469
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2016.1213469?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Gang & Feng, Haolin & Luo, Kaiyi & Tang, Yanli, 2021. "Retrieval-oriented storage relocation optimization of an automated storage and retrieval system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    2. Kress, Dominik & Meiswinkel, Sebastian & Pesch, Erwin, 2019. "Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas," European Journal of Operational Research, Elsevier, vol. 279(3), pages 732-750.
    3. Mirzaei, Masoud & Zaerpour, Nima & de Koster, René, 2021. "The impact of integrated cluster-based storage allocation on parts-to-picker warehouse performance," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    4. Zhang, Jingran & Onal, Sevilay & Das, Sanchoy, 2020. "The dynamic stocking location problem – Dispersing inventory in fulfillment warehouses with explosive storage," International Journal of Production Economics, Elsevier, vol. 224(C).
    5. Flamand, Tulay & Ghoniem, Ahmed & Haouari, Mohamed & Maddah, Bacel, 2018. "Integrated assortment planning and store-wide shelf space allocation: An optimization-based approach," Omega, Elsevier, vol. 81(C), pages 134-149.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:49:y:2017:i:1:p:13-30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.