IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v47y2025i3d10.1007_s00291-024-00806-7.html

Integrated pallet retrieval and processing in warehouses under uncertainty

Author

Listed:
  • Jan-Niklas Buckow

    (Osnabrück University)

  • Marc Goerigk

    (University of Passau)

  • Sigrid Knust

    (Osnabrück University)

Abstract

We study the problem of integrated pallet retrieval and successive processing in warehouses motivated by a practical company setting. A set of pallets has to be retrieved in a warehouse having a single stacker crane and multiple input/output-points, and the goal is to minimize the makespan. Previous research focuses on minimizing stacker crane travel times, while subsequent pallet processing times at the input/output-points are neglected. A distinction is made between a blocking and buffering variant, in which either no or sufficient buffer space is available at the input/output-points to temporarily store pallets there before they are processed. To hedge against uncertainties in the pallet processing times, we additionally apply robust optimization with budgeted uncertainty sets. We develop dynamic programming algorithms for the worst-case evaluation, identify polynomially solvable cases when there is only a single input/output-point, and present mathematical models for the general case with an arbitrary number of input/output-points. Our extensive computational study reveals that the integrated models yield considerable benefits compared to either ignoring the stacker crane travel times or the pallet processing times. We propose heuristic algorithms that provide good solutions for large instances in a short amount of computational time.

Suggested Citation

  • Jan-Niklas Buckow & Marc Goerigk & Sigrid Knust, 2025. "Integrated pallet retrieval and processing in warehouses under uncertainty," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(3), pages 817-855, September.
    • Handle: RePEc:spr:orspec:v:47:y:2025:i:3:d:10.1007_s00291-024-00806-7
    DOI: 10.1007/s00291-024-00806-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-024-00806-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-024-00806-7?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Levorato, Mario & Figueiredo, Rosa & Frota, Yuri, 2022. "Exact solutions for the two-machine robust flow shop with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 300(1), pages 46-57.
    3. Zhi-Long Chen & Nicholas G. Hall, 2022. "Cooperative Supply Chain Scheduling," International Series in Operations Research & Management Science, in: Supply Chain Scheduling, chapter 0, pages 431-548, Springer.
    4. van Dal, Rene & van der Veen, Jack A. A. & Sierksma, Gerard, 1993. "Small and large TSP: Two polynomially solvable cases of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 69(1), pages 107-120, August.
    5. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    6. Zhi-Long Chen & Nicholas G. Hall, 2022. "Noncooperative Supply Chain Scheduling," International Series in Operations Research & Management Science, in: Supply Chain Scheduling, chapter 0, pages 549-659, Springer.
    7. Boysen, Nils & Stephan, Konrad, 2016. "A survey on single crane scheduling in automated storage/retrieval systems," European Journal of Operational Research, Elsevier, vol. 254(3), pages 691-704.
    8. Sun, Yimeng & Qiu, Ruozhen & Sun, Minghe, 2024. "A robust optimization approach for inventory management with limited-time discounts and service-level requirement under demand uncertainty," International Journal of Production Economics, Elsevier, vol. 267(C).
    9. Marc Goerigk & Michael Hartisch, 2024. "An Introduction to Robust Combinatorial Optimization," International Series in Operations Research and Management Science, Springer, number 978-3-031-61261-9, May.
    10. Marcus Ang & Yun Fong Lim & Melvyn Sim, 2012. "Robust Storage Assignment in Unit-Load Warehouses," Management Science, INFORMS, vol. 58(11), pages 2114-2130, November.
    11. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    12. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    13. Zhi-Long Chen & Nicholas G. Hall, 2022. "Supply Chain Scheduling," International Series in Operations Research and Management Science, Springer, number 978-3-030-90374-9, May.
    14. Qiu, Ruozhen & Sun, Yue & Sun, Minghe, 2022. "A robust optimization approach for multi-product inventory management in a dual-channel warehouse under demand uncertainties," Omega, Elsevier, vol. 109(C).
    15. Zhi-Long Chen & Nicholas G. Hall, 2022. "Solution Methods for Supply Chain Scheduling Problems," International Series in Operations Research & Management Science, in: Supply Chain Scheduling, chapter 0, pages 23-49, Springer.
    16. Yanıkoğlu, İhsan & Gorissen, Bram L. & den Hertog, Dick, 2019. "A survey of adjustable robust optimization," European Journal of Operational Research, Elsevier, vol. 277(3), pages 799-813.
    17. Roodbergen, Kees Jan & Vis, Iris F.A., 2009. "A survey of literature on automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 194(2), pages 343-362, April.
    18. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    19. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    20. Bruni, M.E. & Di Puglia Pugliese, L. & Beraldi, P. & Guerriero, F., 2017. "An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations," Omega, Elsevier, vol. 71(C), pages 66-84.
    21. Yeming Gong & René de Koster, 2011. "A review on stochastic models and analysis of warehouse operations," Post-Print hal-02312651, HAL.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Pawel Zajac, 2025. "Energy Consumption of Transfer Points in Passive and Plus-Energy Warehouses—A Systemic Approach to Internal Transport," Sustainability, MDPI, vol. 17(21), pages 1-18, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Agnetis, Alessandro & Billaut, Jean-Charles & Pinedo, Michael & Shabtay, Dvir, 2025. "Fifty years of research in scheduling — Theory and applications," European Journal of Operational Research, Elsevier, vol. 327(2), pages 367-393.
    2. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    3. Wang, Miao & Li, Feng & Xu, Zhou & Yang, Xianyan & Wang, Julong, 2026. "Order selection and fulfillment integration with flexible products," Omega, Elsevier, vol. 138(C).
    4. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    5. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    6. Slikker, Marco, 2023. "The stable gain splitting rule for sequencing situations," European Journal of Operational Research, Elsevier, vol. 310(2), pages 902-913.
    7. Berghman, Lotte & Kergosien, Yannick & Billaut, Jean-Charles, 2023. "A review on integrated scheduling and outbound vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 1-23.
    8. Yang, Xianyan & Li, Feng & Liu, Zhixue & Xu, Zhou, 2024. "New exact and heuristic algorithms for general production and delivery integration," European Journal of Operational Research, Elsevier, vol. 316(2), pages 419-442.
    9. Elisama Araújo Silva Oliveira & Elizabeth Wanner & Elisangela Martins Sá & Sérgio Ricardo Souza, 2025. "A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs," Journal of Heuristics, Springer, vol. 31(1), pages 1-57, March.
    10. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    11. Rauchecker, Gerhard & Schryen, Guido, 2019. "An exact branch-and-price algorithm for scheduling rescue units during disaster response," European Journal of Operational Research, Elsevier, vol. 272(1), pages 352-363.
    12. Frederik Ferid Ostermeier & Jochen Deuse, 2024. "A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing," Journal of Scheduling, Springer, vol. 27(1), pages 29-49, February.
    13. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    14. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    15. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    16. Claeys, Dieter & Adan, Ivo & Boxma, Onno, 2016. "Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations," European Journal of Operational Research, Elsevier, vol. 254(3), pages 895-906.
    17. Boysen, Nils & de Koster, René & Weidinger, Felix, 2019. "Warehousing in the e-commerce era: A survey," European Journal of Operational Research, Elsevier, vol. 277(2), pages 396-411.
    18. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    19. Boysen, Nils & Schwerdfeger, Stefan & Stephan, Konrad, 2023. "A review of synchronization problems in parts-to-picker warehouses," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1374-1390.
    20. Mac Cawley, Alejandro & Maturana, Sergio & Pascual, Rodrigo & Tortorella, Guilherme Luz, 2022. "Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: Robust formulation and a decomposition solution approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 819-839.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:spr:orspec:v:47:y:2025:i:3:d:10.1007_s00291-024-00806-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.