کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
474700 | 699101 | 2012 | 9 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion](/preview/png/474700.png)
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.
Journal: Computers & Operations Research - Volume 39, Issue 9, September 2012, Pages 2152–2160