{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T05:25:58Z","timestamp":1767072358978,"version":"3.48.0"},"reference-count":44,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T00:00:00Z","timestamp":1766707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862041"],"award-info":[{"award-number":["61862041"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004775","name":"Natural Science Foundation of Gansu Province","doi-asserted-by":"publisher","award":["21JR7RA120"],"award-info":[{"award-number":["21JR7RA120"]}],"id":[{"id":"10.13039\/501100004775","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>The dynamic flexible job shop scheduling problem (DFJSP) with machine faults, considering the recovery condition and variable processing time, is studied to determine the rescheduling scheme when machine faults occur in real time. The Monte Carlo Tree Search (MCTS) algorithm with reinforcement learning and the relational-enhanced graph attention network (MGRL) is presented to address the DFJSP with machine faults, considering the recovery condition and variable processing time. The MCTS with the skip-node restart strategy, which utilizes local optimal solutions found during the Monte Carlo sampling process, is designed to enhance the optimization efficiency of MCTS in real time. A relational graph attention network (RGAT), a relational-enhanced and transformer-integrated graph network in the MGRL, is designed to analyze the scheduling disjunctive graph, guide the Monte Carlo sampling method to improve sampling efficiency, and enhance the quality of MCTS optimization decisions. Experimental results demonstrate the effectiveness of the RGAT and the skip-node restart strategy. Further application analysis results show that the MGRL is optimal among all comparison methods when algorithms solve the DFJSP.<\/jats:p>","DOI":"10.3390\/bdcc10010009","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T08:47:27Z","timestamp":1766998047000},"page":"9","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Monte Carlo Tree Search with Reinforcement Learning and Graph Relational Attention Network for Dynamic Flexible Job Shop Scheduling Problem"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8266-8772","authenticated-orcid":false,"given":"Yu","family":"Jia","sequence":"first","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Lanzhou University of Technology, Lanzhou 730050, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9969-113X","authenticated-orcid":false,"given":"Rui","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Lanzhou University of Technology, Lanzhou 730050, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1488-388X","authenticated-orcid":false,"given":"Qiuyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Lanzhou University of Technology, Lanzhou 730050, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"113231","DOI":"10.1016\/j.asoc.2025.113231","article-title":"From fluid relaxations to double deep Q-network for Dynamic Multiplicity Flexible Job-Shop Scheduling","volume":"177","author":"Yang","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","article-title":"A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems","volume":"6","author":"Gao","year":"2019","journal-title":"IEEE-CAA J. Autom. Sin."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TEVC.2022.3175832","article-title":"A Learning-Based Memetic Algorithm for Energy-Efficient Flexible Job-Shop Scheduling With Type-2 Fuzzy Processing Time","volume":"27","author":"Li","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","article-title":"Review of job shop scheduling research and its new perspectives under Industry 4.0","volume":"30","author":"Zhang","year":"2019","journal-title":"J. Intell. Manuf."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"102770","DOI":"10.1016\/j.omega.2022.102770","article-title":"Scheduling of Multi-Robot Job Shop Systems in Dynamic Environments: Mixed-Integer Linear Programming and Constraint Programming Approaches","volume":"115","author":"Foumani","year":"2023","journal-title":"Omega"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Jazmin Escamilla-Serna, N., Carlos Seck-Tuoh-Mora, J., Medina-Marin, J., Barragan-Vite, I., and Ramon Corona-Armenta, J. (2022). A Hybrid Search Using Genetic Algorithms and Random-Restart Hill-Climbing for Flexible Job Shop Scheduling Instances with High Flexibility. Appl. Sci., 12.","DOI":"10.3390\/app12168050"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"106751","DOI":"10.1016\/j.cor.2020.104951","article-title":"Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem","volume":"121","author":"Ding","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"106751","DOI":"10.1016\/j.cor.2024.106751","article-title":"Learning tabu search algorithms: A scheduling application","volume":"170","author":"Niroumandrad","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"ref_9","unstructured":"Hua-li, F., He-gen, X., Guo-zhang, J., and Gong-fa, L. (2015, January 27\u201329). Survey of the Selection and Evaluation for Dispatching Rules in Dynamic Job Shop Scheduling Problem. Proceedings of the 2015 Chinese Automation Congress (CAC), Wuhan, China."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1038\/s41586-023-06004-9","article-title":"Faster sorting algorithms discovered using deep reinforcement learning","volume":"618","author":"Mankowitz","year":"2023","journal-title":"Nature"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"117921","DOI":"10.1016\/j.eswa.2022.117921","article-title":"Graph neural network for traffic forecasting: A survey","volume":"207","author":"Jiang","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Pal, C.V., and Leon, F. (2020, January 8\u201310). A Brief Survey of Model-Based Reinforcement Learning Techniques. Proceedings of the 2020 24Th International Conference on System Theory, Control and Computing (ICSTCC), Sinaia, Romania.","DOI":"10.1109\/ICSTCC50638.2020.9259716"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Giraldo, J.H., Skianis, K., Bouwmans, T., and Malliaros, F.D. (2023, January 15\u201321). On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networks. Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, CIKM 2023, Birmingham, UK.","DOI":"10.1145\/3583780.3614997"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1109\/TCI.2023.3328281","article-title":"MD-GraphFormer: A Model-Driven Graph Transformer for Fast Multi-Contrast MR Imaging","volume":"9","author":"Wang","year":"2023","journal-title":"IEEE Trans. Comput. Imaging"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"8662","DOI":"10.1109\/TII.2024.3371489","article-title":"Dynamic Job-Shop Scheduling via Graph Attention Networks and Deep Reinforcement Learning","volume":"20","author":"Liu","year":"2024","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_16","unstructured":"Zhang, C., Cao, Z., Song, W., Wu, Y., and Zhang, J. (2024, January 7\u201311). Deep reinforcement learning guided improvement heuristic for job shop scheduling. Proceedings of the Twelfth International Conference on Learning Representations, Vienna, Austria."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","article-title":"Mastering the game of Go with deep neural networks and tree search","volume":"529","author":"Silver","year":"2016","journal-title":"Nature"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Liu, Z.J., Sang, H.Y., Zheng, C.Z., Chi, H., Gao, K.Z., and Han, Y.Y. (2024). An Effective Multi-Restart Iterated Greedy Algorithm for Multi-Agvs Dispatching Problem in the Matrix Manufacturing Workshop. Expert Syst. Appl., 252.","DOI":"10.1016\/j.eswa.2024.124223"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1673","DOI":"10.1109\/TASE.2024.3369019","article-title":"A Two-Stage Individual Feedback NSGA-III for Dynamic Many-Objective Flexible Job Shop Scheduling Problem","volume":"22","author":"Feng","year":"2024","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.jmsy.2023.09.009","article-title":"Deep reinforcement learning for dynamic flexible job shop scheduling problem considering variable processing times","volume":"71","author":"Zhang","year":"2023","journal-title":"J. Manuf. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"102435","DOI":"10.1016\/j.rcim.2022.102435","article-title":"Edge computing-based real-time scheduling for digital twin flexible job shop with variable time window","volume":"79","author":"Wang","year":"2023","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"8013","DOI":"10.1109\/TCYB.2023.3280175","article-title":"Surprisingly Popular-Based Adaptive Memetic Algorithm for Energy-Efficient Distributed Flexible Job Shop Scheduling","volume":"53","author":"Li","year":"2023","journal-title":"IEEE Trans. Cybern."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Naimi, R., Nouiri, M., and Cardin, O. (2021). A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives. Sustainability, 13.","DOI":"10.3390\/su132313016"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"107211","DOI":"10.1016\/j.cie.2021.107211","article-title":"An effective MCTS-based algorithm for minimizing the makespan in dynamic flexible job shop scheduling problem","volume":"155","author":"Li","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","article-title":"Flexible Job-Shop Scheduling via Graph Neural Network and Deep Reinforcement Learning","volume":"19","author":"Song","year":"2023","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"111940","DOI":"10.1016\/j.knosys.2024.111940","article-title":"Flexible job shop scheduling via deep reinforcement learning with meta-path-based heterogeneous graph neural network","volume":"296","author":"Wan","year":"2024","journal-title":"Knowl.-Based Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/TKDE.2020.2981333","article-title":"Deep Learning on Graphs: A Survey","volume":"34","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"6836","DOI":"10.1109\/TSMC.2023.3287655","article-title":"Dynamic Job-Shop Scheduling Problems Using Graph Neural Network and Deep Reinforcement Learning","volume":"53","author":"Liu","year":"2023","journal-title":"IEEE Trans. Syst. Man Cybern.-Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"111321","DOI":"10.1016\/j.knosys.2023.111321","article-title":"Graphformer: Adaptive graph correlation transformer for multivariate long sequence time series forecasting","volume":"285","author":"Wang","year":"2024","journal-title":"Knowl.-Based Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1109\/TII.2022.3167380","article-title":"A Deep Reinforcement Learning Framework Based on an Attention Mechanism and Disjunctive Graph Embedding for the Job-Shop Scheduling Problem","volume":"19","author":"Chen","year":"2023","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"16521","DOI":"10.1109\/TNNLS.2025.3569868","article-title":"A Reinforcement Learning Control Framework Based on Scalable Graph Transformer for Large-Scale Fuzzy Job Shop Scheduling Problems","volume":"36","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1109\/TCYB.2025.3538007","article-title":"An Iterative Greedy Algorithm for Solving a Multiobjective Distributed Assembly Flexible Job Shop Scheduling Problem with Fuzzy Processing Time","volume":"55","author":"Zhao","year":"2025","journal-title":"IEEE Trans. Cybern."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Li, R., Liu, S., Wang, F., Gao, J., Liu, H., Hu, S., and Yin, M. (2022). A Restart Local Search Algorithm with Relaxed Configuration Checking Strategy for the Minimum K-Dominating Set Problem. Knowl.-Based Syst., 254.","DOI":"10.1016\/j.knosys.2022.109619"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Huang, S.C., Coulom, R., and Lin, S.S. (2010, January 18\u201320). Time Management for Monte-Carlo Tree Search Applied to the Game of Go. Proceedings of the International Conference on Technologies and Applications of Artificial Intelligence (TAAI 2010), Hsinchu, Taiwan.","DOI":"10.1109\/TAAI.2010.78"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1038\/s41586-019-1724-z","article-title":"Grandmaster level in StarCraft II using multi-agent reinforcement learning","volume":"575","author":"Vinyals","year":"2019","journal-title":"Nature"},{"key":"ref_36","first-page":"1390","article-title":"An Improved Reptile Search Algorithm with Ghost Opposition-based Learning for Global Optimization Problems","volume":"10","author":"Jia","year":"2023","journal-title":"J. Comput. Des. Eng."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Song, T., Chen, M., Xu, Y., Wang, D., Song, X., and Tang, X. (2021). Competition-guided Multi-Neighborhood Local Search Algorithm for the University Course Timetabling Problem. Appl. Soft Comput., 110.","DOI":"10.1016\/j.asoc.2021.107624"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Zhang, M., Lu, Y., Hu, Y., Amaitik, N., and Xu, Y. (2022). Dynamic Scheduling Method for Job-Shop Manufacturing Systems by Deep Reinforcement Learning with Proximal Policy Optimization. Sustainability, 14.","DOI":"10.3390\/su14095177"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"101335","DOI":"10.1016\/j.swevo.2023.101335","article-title":"Improved meta-heuristics with Q-learning for solving distributed assembly permutation flowshop scheduling problems","volume":"80","author":"Yu","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1007\/s00521-019-04571-5","article-title":"Application research of improved genetic algorithm based on machine learning in production scheduling","volume":"32","author":"Guo","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"4049","DOI":"10.1080\/00207543.2022.2058432","article-title":"Deep reinforcement learning for dynamic scheduling of a flexible job shop","volume":"60","author":"Liu","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Lara-C\u00e1rdenas, E., Silva-G\u00e1lvez, A., Ortiz-Bayliss, J.C., Amaya, I., Cruz-Duarte, J.M., and Terashima-Mar\u00edn, H. (2020, January 1\u20134). Exploring Reward-based Hyper-heuristics for the Job-shop Scheduling Problem. Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence (SSCI), Canberra, ACT, Australia.","DOI":"10.1109\/SSCI47803.2020.9308131"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.ijpe.2011.04.020","article-title":"Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm","volume":"132","author":"ElMekkawy","year":"2011","journal-title":"Int. J. Prod. Econ."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/10\/1\/9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T05:22:37Z","timestamp":1767072157000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/10\/1\/9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,26]]},"references-count":44,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["bdcc10010009"],"URL":"https:\/\/doi.org\/10.3390\/bdcc10010009","relation":{},"ISSN":["2504-2289"],"issn-type":[{"type":"electronic","value":"2504-2289"}],"subject":[],"published":{"date-parts":[[2025,12,26]]}}}