初始化
可变邻域搜索
计算机科学
流水车间调度
数学优化
局部搜索(优化)
渡线
帕累托原理
作业车间调度
算法
多目标优化
调度(生产过程)
启发式
数学
人工智能
元启发式
地铁列车时刻表
操作系统
程序设计语言
作者
Junqing Li,Xiaolong Chen,Peiyong Duan,Jianhui Mou
标识
DOI:10.1109/tii.2021.3128405
摘要
In this article, a distributed hybrid flow shop scheduling problem with variable speed constraints is considered. To solve it, a knowledge-based adaptive reference points multiobjective algorithm (KMOEA) is developed. In the proposed algorithm, each solution is represented with a 3-D vector, where the factory assignment, machine assignment, operation scheduling, and speed setting are encoded. Then, four problem-specific lemmas are proposed, which are used as the knowledge to guide the main components of the algorithm, including the initialization, global, and local search procedures. Next, an efficient initialization approach is presented, which is embedded with several problem-related initialization rules. Furthermore, a novel Pareto-based crossover heuristic is designed to learn from more promising solutions. To enhance the local search abilities, a speed adjustment local search method is investigated. Finally, a set of instances generated based on the realistic prefabricated production system is tested to verify the efficiency and effectiveness of the proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI