IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v324y2025i3p773-786.html
   My bibliography  Save this article

Mathematical models and heuristics for double-load crane scheduling in slab yards

Author

Listed:
  • Dong, Zixiong
  • Che, Ada
  • Feng, Jianguang

Abstract

This paper studies a novel crane scheduling problem with unconstrained double-load operations (CSP-UDL) in slab yards. It aims to optimize the sequence of crane operations to minimize makespan. Unlike conventional crane operations, which handle one or two slabs per trip, the unconstrained double-load operation enables the transport of more than two slabs in a single trip, thereby improving logistic efficiency and reducing the makespan. To tackle this problem, we propose two mixed integer linear programming (MILP) models for solving small- and medium-sized instances. We develop two heuristics for large-sized instances: a hybrid heuristic and a matheuristic. The hybrid heuristic integrates tabu search within an adaptive large neighborhood search (ALNS) framework, while the matheuristic integrates this hybrid heuristic with an MILP model, leveraging the strengths of both exact and heuristic methods. Extensive computational experiments demonstrate that while the proposed MILP models can exactly solve instances with up to 50 tasks, the hybrid heuristic and the matheuristic demonstrate robust performance in solving large-sized instances.

Suggested Citation

  • Dong, Zixiong & Che, Ada & Feng, Jianguang, 2025. "Mathematical models and heuristics for double-load crane scheduling in slab yards," European Journal of Operational Research, Elsevier, vol. 324(3), pages 773-786.
    • Handle: RePEc:eee:ejores:v:324:y:2025:i:3:p:773-786
    DOI: 10.1016/j.ejor.2025.02.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725001729
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.02.036?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. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. Guodong Zhao & Jiyin Liu & Yun Dong, 2020. "Scheduling the operations of a double-load crane in slab yards," International Journal of Production Research, Taylor & Francis Journals, vol. 58(9), pages 2647-2657, May.
    3. Zapfel, Gunther & Wasner, Michael, 2006. "Warehouse sequencing in the steel supply chain as a generalized job shop model," International Journal of Production Economics, Elsevier, vol. 104(2), pages 482-501, December.
    4. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    5. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    6. Francesco Carrabs & Jean-François Cordeau & Gilbert Laporte, 2007. "Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 618-632, November.
    7. Vallada, Eva & Belenguer, Jose Manuel & Villa, Fulgencia & Alvarez-Valdes, Ramon, 2023. "Models and algorithms for a yard crane scheduling problem in container ports," European Journal of Operational Research, Elsevier, vol. 309(2), pages 910-924.
    8. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    9. Yuan, Yuan & Tang, Lixin, 2017. "Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse," European Journal of Operational Research, Elsevier, vol. 262(2), pages 424-437.
    10. Huang, Baobin & Tang, Lixin & Baldacci, Roberto & Wang, Gongshu & Sun, Defeng, 2023. "A metaheuristic algorithm for a locomotive routing problem arising in the steel industry," European Journal of Operational Research, Elsevier, vol. 308(1), pages 385-399.
    11. Zhang, Zhenzhen & Che, Yuxin & Liang, Zhe, 2024. "Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit," European Journal of Operational Research, Elsevier, vol. 312(3), pages 996-1010.
    12. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," LIDAM Reprints CORE 3273, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Xu Cheng & Lixin Tang & Panos Pardalos, 2015. "A Branch-and-Cut algorithm for factory crane scheduling problem," Journal of Global Optimization, Springer, vol. 63(4), pages 729-755, December.
    14. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    15. Zhang, Shuai & Gajpal, Yuvraj & Appadoo, S.S. & Abdulkader, M.M.S., 2018. "Electric vehicle routing problem with recharging stations for minimizing energy consumption," International Journal of Production Economics, Elsevier, vol. 203(C), pages 404-413.
    16. Lashkari, Shabnam & Wu, Yong & Petering, Matthew E.H., 2017. "Sequencing dual-spreader crane operations: Mathematical formulation and heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 262(2), pages 521-534.
    17. Lixin Tang & Xie Xie & Jiyin Liu, 2014. "Crane scheduling in a warehouse storing steel coils," IISE Transactions, Taylor & Francis Journals, vol. 46(3), pages 267-282.
    18. Gabriela N. Maschietto & Yassine Ouazene & Martín G. Ravetti & Maurício C. de Souza & Farouk Yalaoui, 2017. "Crane scheduling problem with non-interference constraints in a steel coil distribution centre," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1607-1622, March.
    19. Peixin Ge & Ren Zhao & Defeng Sun & Yun Dong, 2022. "Integrated optimisation of storage and pre-marshalling moves in a slab warehouse," International Journal of Production Research, Taylor & Francis Journals, vol. 60(6), pages 2021-2043, March.
    Full references (including those not matched with items on IDEAS)

    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. Christian Weckenborg & Patrick Oetjegerdes & Thomas S. Spengler, 2025. "Energy-oriented crane scheduling in a steel coil storage," Flexible Services and Manufacturing Journal, Springer, vol. 37(1), pages 97-124, March.
    2. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    3. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    4. Lanza, Giacomo & Passacantando, Mauro & Scutellà, Maria Grazia, 2022. "Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches," Omega, Elsevier, vol. 108(C).
    5. Tingxin Wen & Haoting Meng, 2025. "Time-Dependent Multi-Center Semi-Open Heterogeneous Fleet Path Optimization and Charging Strategy," Mathematics, MDPI, vol. 13(7), pages 1-27, March.
    6. Arda, Yasemin & Cattaruzza, Diego & François, Véronique & Ogier, Maxime, 2024. "Home chemotherapy delivery: An integrated production scheduling and multi-trip vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 317(2), pages 468-486.
    7. Loske, Dominic & Klumpp, Matthias, 2021. "Human-AI collaboration in route planning: An empirical efficiency-based analysis in retail logistics," International Journal of Production Economics, Elsevier, vol. 241(C).
    8. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    9. Lai, Minghui & Cai, Xiaoqiang & Hu, Qian, 2017. "An iterative auction for carrier collaboration in truckload pickup and delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 60-80.
    10. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    11. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    12. Zhang, Canrong & Wang, Qi & Yuan, Guoping, 2023. "Novel models and algorithms for location assignment for outbound containers in container terminals," European Journal of Operational Research, Elsevier, vol. 308(2), pages 722-737.
    13. Soriano, Adria & Vidal, Thibaut & Gansterer, Margaretha & Doerner, Karl, 2020. "The vehicle routing problem with arrival time diversification on a multigraph," European Journal of Operational Research, Elsevier, vol. 286(2), pages 564-575.
    14. David Woller & Jakub Rada & Miroslav Kulich, 2023. "The ALNS metaheuristic for the transmission maintenance scheduling," Journal of Heuristics, Springer, vol. 29(2), pages 349-382, June.
    15. Wu, Guoyuan & Peng, Dongbo & Boriboonsomsin, Kanok, 2024. "Developing an Efficient Dispatching Strategy to Support Commercial Fleet Electrification," Institute of Transportation Studies, Working Paper Series qt2qz0n2gv, Institute of Transportation Studies, UC Davis.
    16. Emrah B. Edis & Ozlem Uzun Araz & Ozgur Eski & Rahime Sancar Edis, 2023. "Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 67-109, April.
    17. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    18. Yuan, Yuan & Tang, Lixin, 2017. "Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse," European Journal of Operational Research, Elsevier, vol. 262(2), pages 424-437.
    19. Shejun Deng & Yingying Yuan & Yong Wang & Haizhong Wang & Charles Koll, 2020. "Collaborative multicenter logistics delivery network optimization with resource sharing," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-31, November.
    20. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.

    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:eee:ejores:v:324:y:2025:i:3:p:773-786. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.