计算机科学
模因算法
流水车间调度
作业车间调度
数学优化
流量(数学)
调度(生产过程)
算法
排列(音乐)
分布式计算
局部搜索(优化)
数学
地铁列车时刻表
物理
声学
操作系统
几何学
标识
DOI:10.1016/j.swevo.2016.06.002
摘要
Abstract In this paper, a competitive memetic algorithm (CMA) is proposed to solve the multi-objective distributed permutation flow-shop scheduling problem (MODPFSP) with the makespan and total tardiness criteria. Two populations corresponding to two different objectives are employed in the CMA. Some objective-specific operators are designed for each population, and a special interaction mechanism between two populations is designed. Moreover, a competition mechanism is proposed to adaptively adjust the selection rates of the operators, and some knowledge-based local search operators are developed to enhance the exploitation ability of the CMA. In addition, the influence of the parameters on the performance of the CMA is investigated by using the Taguchi method of design-of-experiment. Finally, extensive computational tests and comparisons are carried out to demonstrate the effectiveness of the CMA in solving the MODPFSP.
科研通智能强力驱动
Strongly Powered by AbleSci AI