DocumentCode :
2291358
Title :
A discrete differential evolution algorithm for lot-streaming flow shop scheduling problems
Author :
Sang, Hong-yan
Author_Institution :
Sch. of Math. Sci., Liaocheng Univ., Liaocheng, China
Volume :
1
fYear :
2010
fDate :
10-12 Aug. 2010
Firstpage :
10
Lastpage :
13
Abstract :
This paper deals with the total weighted tardiness and earliness penalties for lot-streaming flow shop scheduling problems. A discrete differential evolution (DDE) algorithm with job permutations based representation is proposed. In the proposed DDE algorithm, the DE-based evolution is used to perform global exploitation, and a local search procedure based on the insert and swap neighborhood structure is used to enhance the exploration capability, and a restart scheme is employed to avoid the stagnation of the evolution. Extensive computational simulations and comparisons are provided, which demonstrate the effectiveness of the proposed DDE algorithm.
Keywords :
flow shop scheduling; discrete differential evolution algorithm; earliness penalties; global exploitation; insert neighborhood structure; job permutations based representation; local search procedure; lot-streaming flow shop scheduling problems; swap neighborhood structure; total weighted tardiness; Algorithm design and analysis; Computational modeling; Computers; Europe; Job shop scheduling; Processor scheduling; differential evolution; lot-streaming flow shop scheduling; metaheuristics; total weighted earliness and tardiness penalties;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation (ICNC), 2010 Sixth International Conference on
Conference_Location :
Yantai, Shandong
Print_ISBN :
978-1-4244-5958-2
Type :
conf
DOI :
10.1109/ICNC.2010.5583339
Filename :
5583339
Link To Document :
بازگشت