IDEAS home Printed from https://ideas.repec.org/p/dar/wpaper/105391.html
   My bibliography  Save this paper

Picker routing and storage-assignment strategies for precedence-constrained order picking

Author

Listed:
  • Zulj, I.
  • Glock, C. H.
  • Grosse, E. H.
  • Schneider, Michael

Abstract

No abstract is available for this item.

Suggested Citation

  • Zulj, I. & Glock, C. H. & Grosse, E. H. & Schneider, Michael, 2018. "Picker routing and storage-assignment strategies for precedence-constrained order picking," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 105391, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
  • Handle: RePEc:dar:wpaper:105391
    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/105391/
    as

    Download full text from publisher

    File URL: https://www.sciencedirect.com/science/article/pii/S0360835218302869
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Heiko Diefenbach & Simon Emde & Christoph H. Glock & Eric H. Grosse, 2022. "New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 535-573, June.
    2. Maria A. M. Trindade & Paulo S. A. Sousa & Maria R. A. Moreira, 2021. "Defining a storage-assignment strategy for precedence-constrained order picking," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 146-160.
    3. Masae, Makusee & Glock, Christoph H. & Vichitkunakorn, Panupong, 2021. "A method for efficiently routing order pickers in the leaf warehouse," International Journal of Production Economics, Elsevier, vol. 234(C).
    4. Çelik, Melih & Archetti, Claudia & Süral, Haldun, 2022. "Inventory routing in a warehouse: The storage replenishment routing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1117-1132.
    5. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    6. Zhong, Shuya & Giannikas, Vaggelis & Merino, Jorge & McFarlane, Duncan & Cheng, Jun & Shao, Wei, 2022. "Evaluating the benefits of picking and packing planning integration in e-commerce warehouses," European Journal of Operational Research, Elsevier, vol. 301(1), pages 67-81.
    7. Raffaele Carli & Mariagrazia Dotoli & Salvatore Digiesi & Francesco Facchini & Giorgio Mossa, 2020. "Sustainable Scheduling of Material Handling Activities in Labor-Intensive Warehouses: A Decision and Control Model," Sustainability, MDPI, vol. 12(8), pages 1-25, April.
    8. Dominik Goeke & Michael Schneider, 2021. "Modeling Single-Picker Routing Problems in Classical and Modern Warehouses," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 436-451, May.
    9. Maria A. M. Trindade & Paulo S. A. Sousa & Maria R. A. Moreira, 2022. "Ramping up a heuristic procedure for storage location assignment problem with precedence constraints," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 646-669, September.
    10. Boysen, Nils & de Koster, René & Füßler, David, 2021. "The forgotten sons: Warehousing systems for brick-and-mortar retail chains," European Journal of Operational Research, Elsevier, vol. 288(2), pages 361-381.

    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:dar:wpaper:105391. 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: Dekanatssekretariat (email available below). General contact details of provider: https://edirc.repec.org/data/ivthdde.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.