.png){kind=icon}
返回
Nondominated sorting genetic algorithm-II with Q-learning for the distributed permutation flowshop rescheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2023.110880.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The distributed permutation flowshop problem (DPFSP) has been extensively studied in recent years. However, most of the research has overlooked the disturbance factors in the processing environment, such as the arrival of new jobs. To address this issue, a nondominated sorting genetic algorithm-II (NSGA-II) with Q-learning has been developed. First, an iterated greedy algorithm (IG) is proposed to generate an initial solution for the first stage. Then, the NSGA-II algorithm is designed to optimize dual-objective problems in the second stage, and the Q-learning algorithm is used to adjust the algorithm parameters. Next, two local search strategies based on key factories are adopted, including critical factory-based insert and swap operations. Finally, a comprehensive experiment of the proposed algorithm against other advanced multiobjective algorithms is conducted. The results confirm that the proposed algorithm can solve the distributed permutation flowshop rescheduling problem with high efficiency.& COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Distributed flowshop
Rescheduling
Multiobjective
NSGA-II algorithm
Q-learning
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning基于双Q学习的装配时间不确定的装配车间自适应调度
PREAI
分享收藏分享收藏
查看更多内容