DocumentCode :
577597
Title :
A differential evolution algorithm with two speed-up methods for NFSSP with SDSTs and RDs
Author :
Qian, Bin ; Du, Puze ; Hu, Rong ; Che, Guolin
Author_Institution :
Dept. of Autom., Kunming Univ. of Sci. & Technol., Kunming, China
fYear :
2012
fDate :
6-8 July 2012
Firstpage :
490
Lastpage :
495
Abstract :
This paper presents a differential evolution algorithm with two speed-up methods (DEJTSM) for solving the no-wait flow-shop scheduling problem (NFSSP) with sequence-dependent setup times (SDSTs) and release dates (RDs). The criterion is to minimize the total completion time. To balance the exploration and exploitation abilities of our DE TSM, DE-based global search is utilized to find the promising regions or solutions over the solution space, and a fast local search according to two speed-up methods is designed to fast exploit the neighborhoods of these regions. Simulation results based on a set of random instances and comparisons with several effective meta-heuristics demonstrate the superiority of DE_FNES in terms of searching quality and efficiency.
Keywords :
evolutionary computation; flow shop scheduling; random processes; search problems; DE-based global search; DEJTSM; DE_FNES; NFSSP; RD; SDST; differential evolution algorithm; exploitation ability; exploration ability; meta-heuristics; no-wait flow-shop scheduling problem; random instances; release dates; searching efficiency; searching quality; sequence-dependent setup times; two speed-up methods; differential evolution; fast local search; no-wait flow-shop scheduling; sequence-dependent setup times and release dates; speed-up methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation (WCICA), 2012 10th World Congress on
Conference_Location :
Beijing
Print_ISBN :
978-1-4673-1397-1
Type :
conf
DOI :
10.1109/WCICA.2012.6357925
Filename :
6357925
Link To Document :
بازگشت