TY - JOUR
T1 - A Q-Learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources
AU - Chen, Rensheng
AU - Wu, Bin
AU - Wang, Hua
AU - Tong, Huagang
AU - Yan, Feiyi
N1 - Publisher Copyright:
© 2024 Elsevier B.V.
PY - 2024/10
Y1 - 2024/10
N2 - With the widespread adoption of intelligent transportation equipment such as AGVs in the manufacturing field, the flexible job shop scheduling considering limited transportation resources has increasingly attracted attention. However, current research does not consider various dynamic disturbances in real production scenarios, resulting in lower executability of scheduling solutions. To solve this problem, a dynamic flexible job shop scheduling model with limited transportation resources is established, aiming to minimize makespan and total energy consumption. Considering three types of disturbances: job cancellation, machine breakdown, and AGV breakdown, the corresponding event-driven rescheduling strategy is proposed, and a rescheduling instability index is designed to measure the performance of the rescheduling strategy. A Q-Learning-based NSGA-II algorithm (QNSGA-II) is proposed. By learning the feedback historical search experience, it adaptively selects the appropriate neighborhood structures for local search; and a hybrid initialization strategy tailored to the problem characteristics is designed to improve the optimization performance of the algorithm. Through simulation experiments, the effectiveness of the rescheduling strategies and the superiority of the QNSGA-II algorithm in solving such problems are validated.
AB - With the widespread adoption of intelligent transportation equipment such as AGVs in the manufacturing field, the flexible job shop scheduling considering limited transportation resources has increasingly attracted attention. However, current research does not consider various dynamic disturbances in real production scenarios, resulting in lower executability of scheduling solutions. To solve this problem, a dynamic flexible job shop scheduling model with limited transportation resources is established, aiming to minimize makespan and total energy consumption. Considering three types of disturbances: job cancellation, machine breakdown, and AGV breakdown, the corresponding event-driven rescheduling strategy is proposed, and a rescheduling instability index is designed to measure the performance of the rescheduling strategy. A Q-Learning-based NSGA-II algorithm (QNSGA-II) is proposed. By learning the feedback historical search experience, it adaptively selects the appropriate neighborhood structures for local search; and a hybrid initialization strategy tailored to the problem characteristics is designed to improve the optimization performance of the algorithm. Through simulation experiments, the effectiveness of the rescheduling strategies and the superiority of the QNSGA-II algorithm in solving such problems are validated.
KW - Dynamic scheduling
KW - Flexible job shop scheduling problem
KW - Limited transportation resources
KW - NSGA-II
KW - Q-Learning algorithm
UR - http://www.scopus.com/inward/record.url?scp=85198755340&partnerID=8YFLogxK
U2 - 10.1016/j.swevo.2024.101658
DO - 10.1016/j.swevo.2024.101658
M3 - 文章
AN - SCOPUS:85198755340
SN - 2210-6502
VL - 90
JO - Swarm and Evolutionary Computation
JF - Swarm and Evolutionary Computation
M1 - 101658
ER -