IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v28y2025i4d10.1007_s10951-025-00839-y.html
   My bibliography  Save this article

A hybrid approach for the dynamic flexible job shop scheduling problem considering machine failures

Author

Listed:
  • Chong Peng

    (Beihang University)

  • Zhongwen Zhang

    (Beihang University
    Beijing Xinghang Mechanical and Electrical Equipment Co., Ltd.)

  • T. Warren Liao

    (Louisiana State University
    Chaoyang University of Technology)

  • Hui Zhao

    (Beihang University)

  • Yuzhen Cai

    (Beihang University)

Abstract

In practical production scheduling, dynamic disturbances such as machine failures frequently disrupt initial schedules. In this research, a new approach using a genetic algorithm prescheduling and machining path routing strategy is proposed to solve the dynamic flexible job shop scheduling problem. Firstly, the efficiency of the scheduling algorithm is improved by a genetic algorithm with an improved active decoding method and a rescheduling algorithm with a dual strategy of right shift and processing path rerouting. Then, a more reasonable solution is obtained by path rerouting in the framework of a prescheduling strategy using a binary tree-based identification system to determine the set of affected processes to reduce the restriction on alternative paths while increasing the search range. Finally, the proposed rescheduling algorithm is compared with two methods through experimental comparisons, which confirms that the algorithm can obtain a more robust and stable solution.

Suggested Citation

  • Chong Peng & Zhongwen Zhang & T. Warren Liao & Hui Zhao & Yuzhen Cai, 2025. "A hybrid approach for the dynamic flexible job shop scheduling problem considering machine failures," Journal of Scheduling, Springer, vol. 28(4), pages 407-424, August.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:4:d:10.1007_s10951-025-00839-y
    DOI: 10.1007/s10951-025-00839-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-025-00839-y
    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/s10951-025-00839-y?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. Qiang Zhang & Xiaonong Lu & Zhanglin Peng & Minglun Ren, 2019. "Perspective: a review of lifecycle management research on complex products in smart-connected environments," International Journal of Production Research, Taylor & Francis Journals, vol. 57(21), pages 6758-6779, November.
    2. Gurkan Ozturk & Ozan Bahadir & Aydin Teymourifar, 2019. "Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 3121-3137, May.
    3. Selcuk Goren & Ihsan Sabuncuoglu, 2010. "Optimization of schedule robustness and stability under random machine breakdowns and processing time variability," IISE Transactions, Taylor & Francis Journals, vol. 42(3), pages 203-220.
    4. Xiong, Jian & Xing, Li-ning & Chen, Ying-wu, 2013. "Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns," International Journal of Production Economics, Elsevier, vol. 141(1), pages 112-126.
    5. Raja Awais Liaqait & Shermeen Hamid & Salman Sagheer Warsi & Azfar Khalid, 2021. "A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0," Sustainability, MDPI, vol. 13(14), pages 1-19, July.
    6. Al-Hinai, Nasr & ElMekkawy, T.Y., 2011. "Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm," International Journal of Production Economics, Elsevier, vol. 132(2), pages 279-291, August.
    7. Philippe Chrétienne, 2020. "Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures," Journal of Scheduling, Springer, vol. 23(1), pages 135-143, February.
    8. Iwona Paprocka, 2019. "The model of maintenance planning and production scheduling for maximising robustness," International Journal of Production Research, Taylor & Francis Journals, vol. 57(14), pages 4480-4501, July.
    9. Van de Vonder, Stijn & Demeulemeester, Erik & Herroelen, Willy & Leus, Roel, 2005. "The use of buffers in project management: The trade-off between stability and makespan," International Journal of Production Economics, Elsevier, vol. 97(2), pages 227-240, August.
    10. Ahmed M. Deif & Hoda A. ElMaraghy, 2017. "Variety and volume dynamic management for value creation in changeable manufacturing systems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(5), pages 1516-1529, 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. Zigao Wu & Shaohua Yu & Tiancheng Li, 2019. "A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling," Mathematics, MDPI, vol. 7(6), pages 1-19, June.
    2. Che, Ada & Feng, Jianguang & Chen, Haoxun & Chu, Chengbin, 2015. "Robust optimization for the cyclic hoist scheduling problem," European Journal of Operational Research, Elsevier, vol. 240(3), pages 627-636.
    3. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.
    4. Shichang Xiao & Zigao Wu & Hongyan Dui, 2022. "Resilience-Based Surrogate Robustness Measure and Optimization Method for Robust Job-Shop Scheduling," Mathematics, MDPI, vol. 10(21), pages 1-22, October.
    5. Shichang Xiao & Shudong Sun & Jionghua (Judy) Jin, 2017. "Surrogate Measures for the Robust Scheduling of Stochastic Job Shop Scheduling Problems," Energies, MDPI, vol. 10(4), pages 1-26, April.
    6. Didden, Jeroen B.H.C. & Dang, Quang-Vinh & Adan, Ivo J.B.F., 2024. "Enhancing stability and robustness in online machine shop scheduling: A multi-agent system and negotiation-based approach for handling machine downtime in industry 4.0," European Journal of Operational Research, Elsevier, vol. 316(2), pages 569-583.
    7. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    8. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    9. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    10. Rostami, Salim & Creemers, Stefan & Leus, Roel, 2024. "Maximizing the net present value of a project under uncertainty: Activity delays and dynamic policies," European Journal of Operational Research, Elsevier, vol. 317(1), pages 16-24.
    11. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    12. Jose L. Andrade-Pineda & David Canca & Pedro L. Gonzalez-R & M. Calle, 2020. "Scheduling a dual-resource flexible job shop with makespan and due date-related criteria," Annals of Operations Research, Springer, vol. 291(1), pages 5-35, August.
    13. Taejong Joo & Hyunyoung Jun & Dongmin Shin, 2022. "Task Allocation in Human–Machine Manufacturing Systems Using Deep Reinforcement Learning," Sustainability, MDPI, vol. 14(4), pages 1-18, February.
    14. Yan Zhao & Nanfang Cui & Wendi Tian, 2020. "A two-stage approach for the critical chain project rescheduling," Annals of Operations Research, Springer, vol. 285(1), pages 67-95, February.
    15. Yuhang Zeng & Ping Lou & Jianmin Hu & Chuannian Fan & Quan Liu & Jiwei Hu, 2025. "Dual-Resource Scheduling with Improved Forensic-Based Investigation Algorithm in Smart Manufacturing," Mathematics, MDPI, vol. 13(9), pages 1-30, April.
    16. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    17. Weihua Qi & Wenyuan Yang & Lining Xing & Feng Yao, 2022. "Modeling and Solving for Multi-Satellite Cooperative Task Allocation Problem Based on Genetic Programming Method," Mathematics, MDPI, vol. 10(19), pages 1-21, October.
    18. Özköse, Hakan & Güney, Gül, 2023. "The effects of industry 4.0 on productivity: A scientific mapping study," Technology in Society, Elsevier, vol. 75(C).
    19. Choo Jun Tan & Siew Chin Neoh & Chee Peng Lim & Samer Hanoun & Wai Peng Wong & Chu Kong Loo & Li Zhang & Saeid Nahavandi, 2019. "Application of an evolutionary algorithm-based ensemble model to job-shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 30(2), pages 879-890, February.
    20. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).

    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:jsched:v:28:y:2025:i:4:d:10.1007_s10951-025-00839-y. 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.