DocumentCode
254803
Title
Scheduling for flexible flow-shop problem based on an improved genetic algorithm
Author
Xudong Wang ; Qingyun Dai
Author_Institution
Sch. of Inf. Eng., Guangdong Univ. of Technol., Guangzhou, China
fYear
2014
fDate
9-13 April 2014
Firstpage
1
Lastpage
3
Abstract
This paper analyzes the characteristics of flexible flow-shop scheduling problem, using a new coding method and an improved genetic algorithm to solve the problem. This paper solves the problem by using the genetic manipulation and elitism strategy. The experimental results have shown that the proposed algorithm is available and effective approach for the FJSP.
Keywords
flow shop scheduling; genetic algorithms; FJSP; coding method; elitism strategy; flexible flow-shop scheduling problem; genetic manipulation; improved genetic algorithm; Encoding; Genetic algorithms; Job shop scheduling; Processor scheduling; Sociology; Statistics; Flexible flow-shop scheduling problem; coding method; improved genetic algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Electronics - China, 2014 IEEE International Conference on
Conference_Location
Shenzhen
Type
conf
DOI
10.1109/ICCE-China.2014.7029882
Filename
7029882
Link To Document