A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion |
| |
Authors: | Guanlong Deng Xingsheng Gu |
| |
Affiliation: | Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China |
| |
Abstract: | This paper presents a hybrid discrete differential evolution (HDDE) algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion, which is not so well studied. The no-idle condition requires that each machine must process jobs without any interruption from the start of processing the first job to the completion of processing the last job. A novel speed-up method based on network representation is proposed to evaluate the whole insert neighborhood of a job permutation and employed in HDDE, and moreover, an insert neighborhood local search is modified effectively in HDDE to balance global exploration and local exploitation. Experimental results and a thorough statistical analysis show that HDDE is superior to the existing state-of-the-art algorithms by a significant margin. |
| |
Keywords: | No-idle flow shop Scheduling Differential evolution Speed-up Insert neighborhood Local search |
本文献已被 ScienceDirect 等数据库收录! |