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

Robust optimization algorithm for integrated crane assignment and scheduling in slab yard with uncertain arrival time

Author

Listed:
  • Xu Wang
  • Qiuhong Zhao
  • Shixin Liu
  • Jia Wang
  • Liang Qi

Abstract

A slab yard served as a key component of the iron and steel plant. Effective slab yard crane assignment and scheduling directly affect the overall efficiency of the steel production process. This work addresses an uncertain slab yard crane assignment and scheduling problem (SYCAS) with the fluctuating arrival time. A stochastic programming model is established to obtain a robust solution that minimises the completion time of slab groups under uncertainty. Due to its NP-hardness, we developed an improved column and cut generation method (IC&CG), which divides the problem into a relaxed master problem (RMP) and a slave problem (SP). A new initialisation strategy for obtaining high-quality solutions and an acceleration strategy for discarding irrelevant scenarios are proposed. We use small-size instances to compare the performance of IC&CG with CPLEX and a generalised column and cut generation method in both deterministic and uncertain environments to validate the effectiveness of the method. For large-size instances, a lower bound (LB) of the optimal objective function is proposed to show the effectiveness of IC&CG. Furthermore, we prove the robustness of the method by sensitive analysis.

Suggested Citation

  • Xu Wang & Qiuhong Zhao & Shixin Liu & Jia Wang & Liang Qi, 2025. "Robust optimization algorithm for integrated crane assignment and scheduling in slab yard with uncertain arrival time," International Journal of Production Research, Taylor & Francis Journals, vol. 63(5), pages 1707-1724, March.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:5:p:1707-1724
    DOI: 10.1080/00207543.2024.2388836
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2388836
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2388836?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.

    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:63:y:2025:i:5:p:1707-1724. 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.