DocumentCode
2378571
Title
A collaborative evolutionary algorithm for multi-objective flexible job shop scheduling problem
Author
Li, X.Y. ; Gao, L.
Author_Institution
State Key Lab. Digital Mfg Equip. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear
2011
fDate
9-12 Oct. 2011
Firstpage
997
Lastpage
1002
Abstract
Flexible job shop scheduling problem (FJSP) is a very important problem in the modern manufacturing system. It is an extension of the classical job shop scheduling problem. Because of the importance of FJSP and the multiple objectives requirement from the real-world production, this research focuses on the multi-objective FJSP. This paper proposes a collaborative evolutionary algorithm (CEA) based on Pareto optimality to solve the multi-objective FJSP. Experimental studies have been used to test the approach. And the experimental results show that the proposed approach is a promising and very effective method on the research of multi-objective FJSP.
Keywords
evolutionary computation; job shop scheduling; manufacturing systems; Pareto optimality; collaborative evolutionary algorithm; manufacturing system; multiobjective FJSP; multiobjective flexible job shop scheduling problem; real-world production; Algorithm design and analysis; Biological cells; Collaboration; Encoding; Evolutionary computation; Job shop scheduling; Optimization; collaborative evolutionary algorithm; flexible job shop scheduling problem; multi-objective; pareto optimality;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on
Conference_Location
Anchorage, AK
ISSN
1062-922X
Print_ISBN
978-1-4577-0652-3
Type
conf
DOI
10.1109/ICSMC.2011.6083799
Filename
6083799
Link To Document