Title :
A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion
Author :
Tasgetiren, M. Fatih ; Pan, Quan-ke ; Suganthan, P.N. ; Liang, Yun-Chia
Author_Institution :
Dept. of Operations Manage. & Busisness Stat., Sultan Qaboos Univ., Muscat
Abstract :
In this paper, a discrete differential evolution (DDE) algorithm is presented to solve the no-wait flowshop scheduling problem with the total flowtime criterion. The DDE algorithm is hybridized with the variable neighborhood descent (VND) algorithm to solve the well-known benchmark suites in the literature. The DDE algorithm is applied to the 110 benchmark instances of Taillard (1993) by treating them as the no-wait flowshop problem instances with the total flowtime criterion. The solution quality is evaluated with optimal solutions, lower bounds and best known solutions provided by Fink & Voss (2003). The computational results show that the DDE algorithm generated better results than those in Fink & Voss (2003).
Keywords :
evolutionary computation; flow shop scheduling; discrete differential evolution algorithm; no-wait flowshop scheduling; total flowtime criterion; variable neighborhood descent algorithm; Cement industry; Chemical industry; Computational intelligence; Engineering management; Food industry; Heuristic algorithms; Job shop scheduling; Machinery production industries; Processor scheduling; Scheduling algorithm;
Conference_Titel :
Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on
Conference_Location :
Honolulu, HI
Print_ISBN :
1-4244-0704-4
DOI :
10.1109/SCIS.2007.367698
