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 search for a different version of it.

    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.

    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: 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.