Discrete Harmony Search Algorithm for Identical Parallel Machine Scheduling Problem
Harmony search (HS)is a recently proposed meta-heuristic,which has gained much attention and some applications during the past decades.In this paper,a discrete HS (DHS)algorithm is proposed for solving identical parallel machines scheduling problem with the objective of minimizing makespan criterion.In the DHS method,a permutation-based encoding method and a new improvisation scheme is proposed to enable the continuous HS algorithm to be applied to solve combinatorial optimization problems.In addition,an efficient local search method is embedded in the DHS algorithm to enhance the accuracy and convergence rate of the proposed method.Numerical results and comparisons with other heuristics demonstrate that the proposed HS algorithm can effectively improve the searching quality.
CHEN Jing LIU Guang-Liang LU Ran
College of Computer Science,Liaocheng University,Liaocheng 252059,P.R.China School of Information Science and Technology,Shandong Normal University,Jinan 250014,P.R.China
国际会议
The 30th Chinese Control Conference(第三十届中国控制会议)
烟台
英文
1-5
2011-07-01（万方平台首次上网日期，不代表论文的发表时间）