IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i21p4048-d959229.html
   My bibliography  Save this article

Resilience-Based Surrogate Robustness Measure and Optimization Method for Robust Job-Shop Scheduling

Author

Listed:
  • Shichang Xiao

    (School of Logistics Engineering, Shanghai Maritime University, Shanghai 201306, China)

  • Zigao Wu

    (Department of Mechanical Engineering, North China Electric Power University, Baoding 071003, China)

  • Hongyan Dui

    (School of Management Engineering, Zhengzhou University, Zhengzhou 450001, China)

Abstract

This paper addresses the robust job-shop scheduling problems (RJSSP) with stochastic deteriorating processing times by considering the resilience of the production schedule. To deal with the disturbances caused by the processing time variations, the expected deviation between the realized makespan and the initial makespan is adopted to measure the robustness of a schedule. A surrogate model for robust scheduling is proposed, which can optimize both the schedule performance and robustness of RJSSP. Specifically, the computational burden of simulation is considered a deficiency for robustness evaluation under the disturbance of stochastic processing times. Therefore, a resilience-based surrogate robustness measure (SRM-R) is provided for the robustness estimation in the surrogate model. The proposed SRM-R considers the production resilience and can utilize the available information on stochastic deteriorating processing times and slack times in the schedule structure by analyzing the disturbance propagation of the correlated operations in the schedule. Finally, a multi-objective hybrid estimation of distribution algorithm is employed to obtain the Pareto optimal solutions of RJSSP. The simulation experiment results show that the presented SRM-R is effective and can provide the Pareto solutions with a lower computational burden. Furthermore, an RJSSP case derived from the manufacturing environment demonstrates that the proposed approach can generate satisfactory robust solutions with significantly improved computational efficiency.

Suggested Citation

  • 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.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:21:p:4048-:d:959229
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/21/4048/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/21/4048/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Qingjie Qi & Yangyang Meng & Xiaofei Zhao & Jianzhong Liu, 2022. "Resilience Assessment of an Urban Metro Complex Network: A Case Study of the Zhengzhou Metro," Sustainability, MDPI, vol. 14(18), pages 1-19, September.
    2. HazIr, Öncü & Haouari, Mohamed & Erel, Erdal, 2010. "Robust scheduling and robustness measures for the discrete time/cost trade-off problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 633-643, December.
    3. Hongyan Dui & Zhe Xu & Liwei Chen & Liudong Xing & Bin Liu, 2022. "Data-Driven Maintenance Priority and Resilience Evaluation of Performance Loss in a Main Coolant System," Mathematics, MDPI, vol. 10(4), pages 1-18, February.
    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. 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. 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. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
    8. S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Anran Zhao & Peng Liu & Xiyu Gao & Guotai Huang & Xiuguang Yang & Yuan Ma & Zheyu Xie & Yunfeng Li, 2022. "Data-Mining-Based Real-Time Optimization of the Job Shop Scheduling Problem," Mathematics, MDPI, vol. 10(23), pages 1-30, December.

    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. 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.
    2. 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.
    3. 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.
    4. Dmitry Ivanov & Alexandre Dolgui & Boris Sokolov & Frank Werner, 2016. "Schedule robustness analysis with the help of attainable sets in continuous flow problem under capacity disruptions," International Journal of Production Research, Taylor & Francis Journals, vol. 54(11), pages 3397-3413, June.
    5. 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.
    6. 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.
    7. 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).
    8. 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.
    9. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
    10. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2022. "Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning," Omega, Elsevier, vol. 111(C).
    11. 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.
    12. Jain, S. & Foley, W.J., 2016. "Dispatching strategies for managing uncertainties in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 248(1), pages 328-341.
    13. Briskorn, Dirk & Leung, Joseph & Pinedo, Michael, 2008. "Robust scheduling on a single machine usinge time buffers," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 639, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Berti, Nicola & Finco, Serena & Battaïa, Olga & Delorme, Xavier, 2021. "Ageing workforce effects in Dual-Resource Constrained job-shop scheduling," International Journal of Production Economics, Elsevier, vol. 237(C).
    15. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    16. Laslo, Zohar & Golenko-Ginzburg, Dimitri & Keren, Baruch, 2008. "Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs," International Journal of Production Economics, Elsevier, vol. 111(2), pages 812-821, February.
    17. Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.
    18. 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.
    19. Alexey Matveev & Varvara Feoktistova & Ksenia Bolshakova, 2016. "On Global Near Optimality of Special Periodic Protocols for Fluid Polling Systems with Setups," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 1055-1070, December.
    20. Servranckx, Tom & Vanhoucke, Mario, 2019. "Strategies for project scheduling with alternative subgraphs under uncertainty: similar and dissimilar sets of schedules," European Journal of Operational Research, Elsevier, vol. 279(1), pages 38-53.

    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:gam:jmathe:v:10:y:2022:i:21:p:4048-:d:959229. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.