IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v35y2023i4d10.1007_s10696-022-09465-8.html
   My bibliography  Save this article

Elite solutions and Tabu assisted variable neighbourhood descent for rescheduling problems in the steelmaking-refining-continuous casting process

Author

Listed:
  • Kunkun Peng

    (Wuhan University of Science and Technology
    Wuhan University of Science and Technology)

  • Xudong Deng

    (Wuhan University of Science and Technology
    Wuhan University of Science and Technology)

  • Chunjiang Zhang

    (Huazhong University of Science and Technology)

  • Weiming Shen

    (Huazhong University of Science and Technology)

  • Yanan Song

    (Zhejiang University)

  • Jianhui Mou

    (Yantai University)

  • Ao Liu

    (Wuhan University of Science and Technology
    Wuhan University of Science and Technology)

Abstract

Steelmaking-refining-Continuous Casting (SCC) is a bottleneck in the iron and steel production operation. In order to enhance production efficiency, SCC scheduling is employed to find an optimal schedule. Unfortunately, dynamic events such as charge start-time delay may occur in a real-world SCC process, which will invalidate the optimal SCC schedule, i.e., making the schedule not optimal or inexecutable. To cope with such a situation, SCC rescheduling is significant for generating a new optimal schedule. This paper proposes a mathematical model of the SCC rescheduling problem considering charge start-time delay, and further presents an Elite solutions and Tabu assisted Variable Neighbourhood Descent (ETVND) method to tackle the problem. The main framework of the ETVND method is Variable Neighbourhood Descent (VND). In the ETVND method, three Tabu based neighbourhood structures are elaborately designed. Moreover, three distinguished features are incorporated, i.e., an elite solutions based exploration strategy, two-layer local search based on the Fruit fly Optimization Algorithm, and multi-type perturbation. The first two features are devised to enhance the intensification abilities while the third is devised to improve the diversification abilities. Experimental results have demonstrated the effectiveness of the ETVND method by comparing with several algorithms in the literature. Further comparison experiments have validated the efficiency of the Tabu based neighbourhood structures and specially devised strategies.

Suggested Citation

  • Kunkun Peng & Xudong Deng & Chunjiang Zhang & Weiming Shen & Yanan Song & Jianhui Mou & Ao Liu, 2023. "Elite solutions and Tabu assisted variable neighbourhood descent for rescheduling problems in the steelmaking-refining-continuous casting process," Flexible Services and Manufacturing Journal, Springer, vol. 35(4), pages 1139-1174, December.
  • Handle: RePEc:spr:flsman:v:35:y:2023:i:4:d:10.1007_s10696-022-09465-8
    DOI: 10.1007/s10696-022-09465-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-022-09465-8
    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/s10696-022-09465-8?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.

    References listed on IDEAS

    as
    1. Pan, Quan-Ke, 2016. "An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling," European Journal of Operational Research, Elsevier, vol. 250(3), pages 702-714.
    2. Jianyu Long & Zhong Zheng & Xiaoqiang Gao, 2017. "Dynamic scheduling in steelmaking-continuous casting production for continuous caster breakdown," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3197-3216, June.
    3. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A mathematical programming model for scheduling steelmaking-continuous casting production," European Journal of Operational Research, Elsevier, vol. 120(2), pages 423-435, January.
    4. Javad Seif & Mohammad Dehghanimohammadabadi & Andrew Junfang Yu, 2020. "Integrated preventive maintenance and flow shop scheduling under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 852-887, December.
    5. Bernardetta Addis & Giuliana Carello & Andrea Grosso & Elena Tànfani, 2016. "Operating room scheduling and rescheduling: a rolling horizon approach," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 206-232, June.
    6. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    7. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2001. "A review of planning and scheduling systems and methods for integrated steel production," European Journal of Operational Research, Elsevier, vol. 133(1), pages 1-20, August.
    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. Torres, Nelson & Greivel, Gus & Betz, Joshua & Moreno, Eduardo & Newman, Alexandra & Thomas, Brian, 2024. "Optimizing steel coil production schedules under continuous casting and hot rolling," European Journal of Operational Research, Elsevier, vol. 314(2), pages 496-508.
    2. Pieter Moerloose & Broos Maenhout, 2023. "A two-stage local search heuristic for solving the steelmaking continuous casting scheduling problem with dual shared-resource and blocking constraints," Operational Research, Springer, vol. 23(1), pages 1-43, March.
    3. Dayong Han & Qiuhua Tang & Zikai Zhang & Zixiang Li, 2020. "An Improved Migrating Birds Optimization Algorithm for a Hybrid Flow Shop Scheduling within Steel Plants," Mathematics, MDPI, vol. 8(10), pages 1-28, September.
    4. Antonio Jiménez-Martín & Alfonso Mateos & Josefa Z. Hernández, 2021. "Aluminium Parts Casting Scheduling Based on Simulated Annealing," Mathematics, MDPI, vol. 9(7), pages 1-18, March.
    5. Zanoni, Simone & Zavanella, Lucio, 2005. "Model and analysis of integrated production-inventory system: The case of steel production," International Journal of Production Economics, Elsevier, vol. 93(1), pages 197-205, January.
    6. Bellabdaoui, A. & Teghem, J., 2006. "A mixed-integer linear programming model for the continuous casting planning," International Journal of Production Economics, Elsevier, vol. 104(2), pages 260-270, December.
    7. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    8. Pan, Quan-Ke, 2016. "An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling," European Journal of Operational Research, Elsevier, vol. 250(3), pages 702-714.
    9. Liu, Min & Jiang, Shenglong & Wu, Cheng, 2015. "A soft-decision based two-layered scheduling approach for uncertain steelmaking-continuous casting processAuthor-Name: Hao, Jinghua," European Journal of Operational Research, Elsevier, vol. 244(3), pages 966-979.
    10. Casado, Silvia & Laguna, Manuel & Pacheco, Joaquín & Puche, Julio C., 2020. "Grouping products for the optimization of production processes: A case in the steel manufacturing industry," European Journal of Operational Research, Elsevier, vol. 286(1), pages 190-202.
    11. Slotnick, Susan A., 2011. "Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size," European Journal of Operational Research, Elsevier, vol. 210(3), pages 527-536, May.
    12. Jianyu Long & Zhong Zheng & Xiaoqiang Gao & Panos M Pardalos, 2016. "A hybrid multi-objective evolutionary algorithm based on NSGA-II for practical scheduling with release times in steel plants," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(9), pages 1184-1199, September.
    13. Gilberto F. Sousa Filho & Teobaldo L. Bulhões Júnior & Lucidio A. F. Cabral & Luiz Satoru Ochi & Fábio Protti, 2017. "New heuristics for the Bicluster Editing Problem," Annals of Operations Research, Springer, vol. 258(2), pages 781-814, November.
    14. Vo[ss], Stefan & Witt, Andreas, 2007. "Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application," International Journal of Production Economics, Elsevier, vol. 105(2), pages 445-458, February.
    15. F. Davarian & J. Behnamian, 2022. "Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints," Journal of Scheduling, Springer, vol. 25(6), pages 625-641, December.
    16. H. Asefi & S. Lim & M. Maghrebi & S. Shahparvari, 2019. "Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management," Annals of Operations Research, Springer, vol. 273(1), pages 75-110, February.
    17. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    18. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    19. Xiaoyu Yu & Jingyi Qian & Yajing Zhang & Min Kong, 2023. "Supply Chain Scheduling Method for the Coordination of Agile Production and Port Delivery Operation," Mathematics, MDPI, vol. 11(15), pages 1-24, July.
    20. Irma-Delia Rojas-Cuevas & Elias Olivares-Benitez & Alfredo S. Ramos & Samuel Nucamendi-Guillén, 2025. "A Capacitated Vehicle Routing Model for Distribution and Repair with a Service Center," Logistics, MDPI, vol. 9(1), pages 1-36, February.

    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:flsman:v:35:y:2023:i:4:d:10.1007_s10696-022-09465-8. 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.