{"title":"基于强化学习的知识导向进化算法求解机器故障下的高效动态柔性作业车间调度问题","authors":"Zhixiao Li , Guohui Zhang , Nana Yu , Shenghui Guo , Wenqiang Zhang","doi":"10.1016/j.swevo.2025.102050","DOIUrl":null,"url":null,"abstract":"<div><div>The flexible job shop scheduling problem is gradually developing towards greening and intelligence. However, in the real production, there are often various dynamic disturbances that result in lower executability of scheduling solutions. Therefore, this paper first investigates the energy efficient dynamic flexible job shop scheduling problem with machine breakdowns. To solve this problem, a knowledge-guided evolutionary algorithm incorporating reinforcement learning (KEARL) is established to minimize maximum completion time, total energy consumption, and workload of critical machines, which is a mixed-integer linear programming model with transportation time of jobs and setup time of machines included. In KEARL, a new rescheduling strategy is designed to reduce the possibility of the machine's second breakdown. In addition, four knowledge-guided initialization methods are also designed and a reinforcement learning-based parameter adaptive strategy is used to optimize the crossover probability and mutation probability, while a knowledge-guided variable neighborhood search strategy enhances the search capability of KEARL. More importantly, three energy efficient methods are implemented to reduce the energy consumption of the production process. Finally, through extensive experiments, the KEARL is compared with several well-known algorithms. The experimental results indicate that KEARL outperforms the other algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102050"},"PeriodicalIF":8.5000,"publicationDate":"2025-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A knowledge-guided evolutionary algorithm incorporating reinforcement learning for energy efficient dynamic flexible job shop scheduling problem with machine breakdowns\",\"authors\":\"Zhixiao Li , Guohui Zhang , Nana Yu , Shenghui Guo , Wenqiang Zhang\",\"doi\":\"10.1016/j.swevo.2025.102050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The flexible job shop scheduling problem is gradually developing towards greening and intelligence. However, in the real production, there are often various dynamic disturbances that result in lower executability of scheduling solutions. Therefore, this paper first investigates the energy efficient dynamic flexible job shop scheduling problem with machine breakdowns. To solve this problem, a knowledge-guided evolutionary algorithm incorporating reinforcement learning (KEARL) is established to minimize maximum completion time, total energy consumption, and workload of critical machines, which is a mixed-integer linear programming model with transportation time of jobs and setup time of machines included. In KEARL, a new rescheduling strategy is designed to reduce the possibility of the machine's second breakdown. In addition, four knowledge-guided initialization methods are also designed and a reinforcement learning-based parameter adaptive strategy is used to optimize the crossover probability and mutation probability, while a knowledge-guided variable neighborhood search strategy enhances the search capability of KEARL. More importantly, three energy efficient methods are implemented to reduce the energy consumption of the production process. Finally, through extensive experiments, the KEARL is compared with several well-known algorithms. The experimental results indicate that KEARL outperforms the other algorithms.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 102050\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650225002081\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002081","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
A knowledge-guided evolutionary algorithm incorporating reinforcement learning for energy efficient dynamic flexible job shop scheduling problem with machine breakdowns
The flexible job shop scheduling problem is gradually developing towards greening and intelligence. However, in the real production, there are often various dynamic disturbances that result in lower executability of scheduling solutions. Therefore, this paper first investigates the energy efficient dynamic flexible job shop scheduling problem with machine breakdowns. To solve this problem, a knowledge-guided evolutionary algorithm incorporating reinforcement learning (KEARL) is established to minimize maximum completion time, total energy consumption, and workload of critical machines, which is a mixed-integer linear programming model with transportation time of jobs and setup time of machines included. In KEARL, a new rescheduling strategy is designed to reduce the possibility of the machine's second breakdown. In addition, four knowledge-guided initialization methods are also designed and a reinforcement learning-based parameter adaptive strategy is used to optimize the crossover probability and mutation probability, while a knowledge-guided variable neighborhood search strategy enhances the search capability of KEARL. More importantly, three energy efficient methods are implemented to reduce the energy consumption of the production process. Finally, through extensive experiments, the KEARL is compared with several well-known algorithms. The experimental results indicate that KEARL outperforms the other algorithms.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.