Efficient Variable Neighborhood Search for Identical Parallel Machines Scheduling
In this paper, a novel variable neighborhood search (VNS) algorithm is proposed for identical parallel machines scheduling problem with the objective of minimizing makespan criterion. To speed up the convergence rate and enhance the quality of the final solution, a machine-based encoding method and four neighborhood structures are introduced in VNS. It is demonstrated that the proposed VNS algorithm can efficiently improve the searching quality when compared with other classical meta-heuristics through a large scale of examinational instances.
Parallel machines scheduling variable neighborhood search combinatorial optimization
CHEN Jing LI Jun-qing
College of Computer Science, Liaocheng University, Liaocheng, 252059, China
国际会议
The 31st Chinese Control Conference(第三十一届中国控制会议)
合肥
英文
7228-7232
2012-07-01（万方平台首次上网日期，不代表论文的发表时间）