IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v21y1973i2p577-589.html
   My bibliography  Save this article

The Rearrangement of Items in a Warehouse

Author

Listed:
  • Nicos Christofides

    (Imperial College of Science and Technology, London, England)

  • I. Colloff

    (Imperial College of Science and Technology, London, England)

Abstract

This paper is concerned with finding the optimal way of rearranging items in a warehouse from their initial positions to their desired final locations. Such a rearrangement may become necessary because of changes in the relative demand for each item, with the result that what were once fast-moving items at the front end of the warehouse, are now only slow-moving ones that must be moved towards the “rear.” Although the problem, as treated in this paper, is addressed to the rearrangement of items in a warehouse, many other applications come immediately to mind, such as the reorganization of the layout of open-plan offices and factories. The paper gives a two-stage algorithm that produces the sequence of item movements necessary to achieve the desired rearrangement and incur the minimum cost (or time) spent in the rearranging process; the result is optimal in the restricted case where the rearrangement must be done in a number of cycles each one being of a short time duration (the case, for example, if the warehouse were to remain operative during the rearrangement).

Suggested Citation

  • Nicos Christofides & I. Colloff, 1973. "The Rearrangement of Items in a Warehouse," Operations Research, INFORMS, vol. 21(2), pages 577-589, April.
    • Handle: RePEc:inm:oropre:v:21:y:1973:i:2:p:577-589
    DOI: 10.1287/opre.21.2.577
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.21.2.577
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.21.2.577?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
    ---><---

    Citations

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


    Cited by:

    1. Pazour, Jennifer A. & Carlo, Héctor J., 2015. "Warehouse reshuffling: Insights and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 207-226.
    2. Guo, Xiaolong & Chen, Ran & Du, Shaofu & Yu, Yugang, 2021. "Storage assignment for newly arrived items in forward picking areas with limited open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).
    3. Niraj Ramesh Dayama & Andreas Ernst & Mohan Krishnamoorthy & Vishnu Narayanan & Narayan Rangaraj, 2017. "New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 307-348, December.
    4. Buckow, Jan-Niklas & Knust, Sigrid, 2023. "The warehouse reshuffling problem with swap moves," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    5. Mohammed Alnahhal & Bashir Salah & Rafiq Ahmad, 2022. "Increasing Throughput in Warehouses: The Effect of Storage Reallocation and the Location of Input/Output Station," Sustainability, MDPI, vol. 14(8), pages 1-16, April.
    6. David Winkelmann & Frederik Tolkmitt & Matthias Ulrich & Michael Romer, 2022. "Integrated storage assignment for an e-grocery fulfilment centre: Accounting for day-of-week demand patterns," Papers 2209.03998, arXiv.org, revised May 2023.

    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:inm:oropre:v:21:y:1973:i:2:p:577-589. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.