和声搜索
拖延
作业车间调度
数学优化
计算机科学
启发式
帕累托原理
水准点(测量)
工作车间
多目标优化
算法
流水车间调度
数学
地铁列车时刻表
操作系统
地理
大地测量学
作者
Kaizhou Gao,Ponnuthurai Nagaratnam Suganthan,Quan-Ke Pan,Tay Jin Chua,Tian Xiang Cai,Chong Chin-Soon
标识
DOI:10.1016/j.ins.2014.07.039
摘要
This paper proposes a Pareto-based grouping discrete harmony search algorithm (PGDHS) to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives, namely the maximum completion time (makespan) and the mean of earliness and tardiness, are considered simultaneously. Firstly, two novel heuristics and several existing heuristics are employed to initialize the harmony memory. Secondly, multiple harmony generation strategies are proposed to improve the performance of harmony search algorithm. The operation sequence in a new harmony is produced based on the encoding method and the characteristics of FJSP. Thirdly, two local search methods based on critical path and due date are embedded to enhance the exploitation capability. Finally, extensive computational experiments are carried out using well-known benchmark instances. Three widely used performance measures, number of non-dominated solutions, diversification metric and quality metric, are employed to test the performance of PGDHS algorithm. Computational results and comparisons show the efficiency and effectiveness of the proposed PGDHS algorithm for solving multi-objective flexible job-shop scheduling problem.
科研通智能强力驱动
Strongly Powered by AbleSci AI