文献类型：期刊文献

英文题名：A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion

作者：Deng, Guanlong[1];Gu, Xingsheng[1]

机构：[1]E China Univ Sci & Technol, Minist Educ, Key Lab Adv Control & Optimizat Chem Proc, Shanghai 200237, Peoples R China

年份：2012

卷号：39

期号：9

起止页码：2152

外文期刊名：COMPUTERS & OPERATIONS RESEARCH

收录：;EI(收录号：20120214675980);WOS:【SCI-EXPANDED(收录号:WOS:000301216600020)】；

基金：This work was supported by National Natural Science Foundation of China (Grant no. 61174040), National High Technology Research and Development Program of China (863 Program) (no. 2009AA04Z141), Shanghai Commission of Science and Technology (Grant no. 08JC1408200), Shanghai Leading Academic Discipline Project (Grant no. B504), Doctor Foundation of Ministry of Education of China (Grant no. 200802510010).

语种：英文

外文关键词：No-idle flow shop; Scheduling; Differential evolution; Speed-up; Insert neighborhood; Local search

摘要：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. (C) 2011 Elsevier Ltd. All rights reserved.