DocumentCode
2295717
Title
Scheduling the lot-streaming flow shop problem using a shuffled frog-leaping algorithm
Author
Duan, Jun-Hua ; Pan, Quan-ke ; Gao, KaiZhuo ; Li, Junqing ; Bao, Zhenqiang
Author_Institution
Sch. of Comput. Sci., Liaocheng Univ., Liaocheng, China
Volume
8
fYear
2010
fDate
10-12 Aug. 2010
Firstpage
4263
Lastpage
4266
Abstract
This paper addresses to the lot-streaming flow shop scheduling problem with makespan criterion. An effective shuffled frog-leaping algorithm (SFLA) with job permutation based representation is proposed. Extensive computational experiments and comparisons demonstrate the effectiveness of the proposed SFLA.
Keywords
flow shop scheduling; job shop scheduling; SFLA; computational experiments; job permutation; lot-streaming flow shop scheduling problem; makespan criterion; shuffled frog leaping algorithm; Computers; Job shop scheduling; Memetics; Optimization; Processor scheduling; Water resources; Flow shop scheduling; Lot-streaming; Makespan; Shuffled frog-leaping algorithm;
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.5583649
Filename
5583649
Link To Document