A Q-learning-based improved multi-objective genetic algorithm for solving distributed heterogeneous assembly flexible job shop scheduling problems with transfers

被引:4
作者
Yang, Zhijie [1 ,2 ]
Hu, Xinkai [1 ]
Li, Yibing [1 ,2 ]
Liang, Muxi [1 ]
Wang, Kaipu [1 ,2 ]
Wang, Lei [1 ,2 ]
Tang, Hongtao [1 ,2 ]
Guo, Shunsheng [1 ,2 ]
机构
[1] Wuhan Univ Technol, Sch Mech & Elect Engn, Wuhan 430070, Peoples R China
[2] Wuhan Univ Technol, Hubei Digital Mfg Key Lab, Wuhan 430070, Peoples R China
关键词
Q; -learning-based; Multi-objective genetic algorithm; Distributed heterogeneous assembly; Job transfer; Flexible job shop scheduling; OPTIMIZATION ALGORITHM; SEARCH; TIMES;
D O I
10.1016/j.jmsy.2025.02.002
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
With the advancement of economic globalization, the distributed heterogeneous factory environment has become the mainstream in manufacturing enterprises. Scheduling flexible job shops in such a production environment holds practical value. However, due to the high complexity of certain jobs, the transfer of jobs between different factories are often required in practical production to balance machine load rates. Accordingly, this study addresses the distributed heterogeneous assembly flexible job shop scheduling problem with transfers, aiming to minimize both the makespan and total energy consumption. First, a multi-objective optimization model is formulated to define the problem, wherein knowledge of factory assignment and processing sequence for operations is summarized. Subsequently, given the complexity of this problem, a Q-learning-based improved multi-objective genetic algorithm (QL-IMOGA) is proposed as an effective approach. Within the proposed algorithm, a hybrid population initialization method is designed, considering factory load balancing and the earliest product completion time, to generate a high-quality initial population. Furthermore, two types of crossover operators, four types of mutation operators, and six objective-oriented neighborhood search operators are devised to enhance the algorithm's exploration and exploitation capabilities. Q-learning is employed for adaptive adjustment of key parameters to improve both convergence speed and solution quality. The effectiveness of the proposed population initialization method and neighborhood search operators is validated through 15 test cases. The results demonstrate that the proposed algorithm significantly outperformed four advanced meta-heuristic algorithms. Furthermore, it is observed that the solution employing the job transfer strategy led to an average reduction of 7.5% in makespan, a 3.9% decrease in total energy consumption, and an 8.4 % improvement in factory load rates compared to the solution using the job no-transfer strategy.
引用
收藏
页码:398 / 418
页数:21
相关论文
共 62 条
[1]   The distributed flow shop scheduling problem with inter-factory transportation [J].
Becker, Tristan ;
Neufeld, Janis ;
Buscher, Udo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 322 (01) :39-55
[2]   Scheduling Semiconductor Testing Facility by Using Cuckoo Search Algorithm With Reinforcement Learning and Surrogate Modeling [J].
Cao, ZhengCai ;
Lin, ChengRan ;
Zhou, MengChu ;
Huang, Ran .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2019, 16 (02) :825-837
[3]   A Q-Learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources [J].
Chen, Rensheng ;
Wu, Bin ;
Wang, Hua ;
Tong, Huagang ;
Yan, Feiyi .
SWARM AND EVOLUTIONARY COMPUTATION, 2024, 90
[4]   A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem [J].
Chen, Ronghua ;
Yang, Bo ;
Li, Shi ;
Wang, Shilong .
COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
[5]   Reinforcement learning for distributed hybrid flowshop scheduling problem with variable task splitting towards mass personalized manufacturing [J].
Chen, Xin ;
Li, Yibing ;
Wang, Kaipu ;
Wang, Lei ;
Liu, Jie ;
Wang, Jun ;
Wang, Xi Vincent .
JOURNAL OF MANUFACTURING SYSTEMS, 2024, 76 :188-206
[6]   Mathematical model and adaptive multi-objective evolutionary algorithm for cellular manufacturing with mixed production mode [J].
Cheng, Lixin ;
Tang, Qiuhua ;
Zhang, Liping .
SWARM AND EVOLUTIONARY COMPUTATION, 2024, 86
[7]   Mathematical model and augmented simulated annealing algorithm for mixed-model assembly job shop scheduling problem with batch transfer [J].
Cheng, Lixin ;
Tang, Qiuhua ;
Liu, Shengli ;
Zhang, Liping .
KNOWLEDGE-BASED SYSTEMS, 2023, 279
[8]   Mathematical model and adaptive simulated annealing algorithm for mixed-model assembly job-shop scheduling with lot streaming [J].
Cheng, Lixin ;
Tang, Qiuhua ;
Zhang, Liping .
JOURNAL OF MANUFACTURING SYSTEMS, 2023, 70 :484-500
[9]   Inventory and total completion time minimization for assembly job-shop scheduling considering material integrity and assembly sequential constraint [J].
Cheng, Lixin ;
Tang, Qiuhua ;
Zhang, Liping ;
Li, Zixiang .
JOURNAL OF MANUFACTURING SYSTEMS, 2022, 65 :660-672
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197