IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i7p2086-2104.html
   My bibliography  Save this article

The min–max order picking problem in synchronised dynamic zone-picking systems

Author

Listed:
  • Serhat Saylam
  • Melih Çelik
  • Haldun Süral

Abstract

In both manual and automated warehouses, a combination of efficient zoning and picker routing plays an important role in improving travel time, congestion, and system throughput. This paper considers the order picker routing problem in a dynamic and synchronised zoning environment, where the items corresponding to each customer order are picked simultaneously in multiple zones, and zones may change between different orders. The objective is to minimise the maximum time of completing the picking activities in any zone. Using a min–max type of objective not only minimises the makespan of an order picking wave, but it also helps balance the workload of the order pickers more effectively. We present a mathematical model for the optimal solution of this problem, as well as a dynamic programming approach to find the optimal solution for the case where a zone is a set of adjacent aisles. Computational experiments on randomly generated instances show that the dynamic programming approach is able to find optimal solutions in negligible computational times.

Suggested Citation

  • Serhat Saylam & Melih Çelik & Haldun Süral, 2023. "The min–max order picking problem in synchronised dynamic zone-picking systems," International Journal of Production Research, Taylor & Francis Journals, vol. 61(7), pages 2086-2104, April.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:7:p:2086-2104
    DOI: 10.1080/00207543.2022.2058433
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2058433
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2058433?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. Kaibo Liang & Li Zhou & Jianglong Yang & Huwei Liu & Yakun Li & Fengmei Jing & Man Shan & Jin Yang, 2023. "Research on a Dynamic Task Update Assignment Strategy Based on a “Parts to Picker” Picking System," Mathematics, MDPI, vol. 11(7), pages 1-29, March.

    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:tprsxx:v:61:y:2023:i:7:p:2086-2104. 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/TPRS20 .

    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.