流水车间调度
数学优化
计算机科学
随机性
贪婪随机自适应搜索过程
排列(音乐)
算法
贪婪算法
作业车间调度
数学
迭代函数
调度(生产过程)
操作系统
声学
统计
地铁列车时刻表
数学分析
物理
作者
Xue-Lei Jing,Quan-Ke Pan,Liang Gao,Ling Wang
出处
期刊:IEEE transactions on systems, man, and cybernetics
[Institute of Electrical and Electronics Engineers]
日期:2022-09-01
卷期号:52 (9): 5783-5794
被引量:12
标识
DOI:10.1109/tsmc.2021.3131849
摘要
A new scheduling problem, the distributed permutation flowshop scheduling problem with uncertain processing times and carryover sequence-dependent setup time (DPUC), is addressed. The DPUC is an important application problem in modern electronics manufacturing. A robust model is established for the DPUC with makespan criterion. A counter-intuitive paradox is found, that is, adding a new job to one of the production lines can reduce the completion time of the production line. Two acceleration methods are provided to save computational efforts. An iterated greedy algorithm called IG_FS is proposed to solve the DPUC. A heuristic based on the well-known NEH is proposed to generate the initial solution for the IG_FS. In the destruction phase of the IG_FS, dynamic sizes based on both adaptability and randomness are provided to improve the exploration capability. During the local search phase of the IG_FS, a hybrid local search method consisting of shift and swap operators is presented to exploit more diverse search areas. Extensive experiments show that the proposed IG_FS performs significantly better than the six competing algorithms adapted from the closely related scheduling literature.
科研通智能强力驱动
Strongly Powered by AbleSci AI