IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v1y2007i3p301-316.html
   My bibliography  Save this article

Order oriented slotting: a new assignment strategy for warehouses

Author

Listed:
  • 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]

Suggested Citation

  • Ronald J. Mantel & Peter C. Schuur & Sunderesh S. Heragu, 2007. "Order oriented slotting: a new assignment strategy for warehouses," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 1(3), pages 301-316.
    • Handle: RePEc:ids:eujine:v:1:y:2007:i:3:p:301-316
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=14689
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Jonas F. Leon & Yuda Li & Mohammad Peyman & Laura Calvet & Angel A. Juan, 2023. "A Discrete-Event Simheuristic for Solving a Realistic Storage Location Assignment Problem," Mathematics, MDPI, vol. 11(7), pages 1-24, March.
    2. Kovács, András, 2011. "Optimizing the storage assignment in a warehouse served by milkrun logistics," International Journal of Production Economics, Elsevier, vol. 133(1), pages 312-318, September.
    3. Yang, Peng & Zhao, Zhijie & Guo, Huijie, 2020. "Order batch picking optimization under different storage scenarios for e-commerce warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    4. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    5. Schuur, Peter C., 2015. "The worst-case performance of the Cube per Order Index slotting strategy is infinitely bad – A technical note," International Journal of Production Economics, Elsevier, vol. 170(PC), pages 801-804.

    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:ids:eujine:v:1:y:2007:i:3:p:301-316. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.