An effective discrete harmony search for solving bi-criteria FJSP
In this paper, a hybrid Pareto-based harmony search (HS) algorithm was proposed for solving the bi-criteria flexible job shop scheduling problem (FJSP). The two objectives were considered concurrently, i.e., to minimize the maximal completion time and to minimize the total workload of all machines. The discrete harmony search (DHS) was developed, which combined detailed designed crossover and mutant operators to obtain both convergence capability and population diversity. An external Pareto archive with non-dominated sorting method was created to store the non-dominated solutions found so far, so that to obtain the near Pareto front solutions. Experimental results based on the two well-known benchmarks conclude that our hybrid algorithm is superior to the other most recently approaches in terms of both solution quality and computational complexity.
Harmony search Flexible job shop scheduling problem Multi-objective optimization Local search Pareto archive set
Junqing Li Quanke Pan Shengxian Xie Kaizhou Gao Yuting Wang
School of Computer,Liaocheng University,Liaocheng,Shandong,252059,China School of Computer,Liaocheng University,Liaocheng, Shandong,252059,China
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
3633-3637
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）