DocumentCode
3026769
Title
An improved multi-objective genetic algorithm for solving flexible job shop problem
Author
Sheng-Ta Hsieh ; Shih-Yuan Chiu ; Shi-Jim Yen
Author_Institution
Dept. of Commun. Eng., Oriental Inst. of Technol., Taipei, Taiwan
fYear
2010
fDate
4-6 Aug. 2010
Firstpage
427
Lastpage
431
Abstract
In this paper, a solution searching strategy called advanced solution extraction is proposed to assistant multi-objective optimizer for solving flexible job shop problem (FJSP). The goal of this problem is to finish all jobs within minimal critical machine workload, total workload and executing time, simultaneously. For comparing proposed with related work, experiments employ three benchmarks. Each benchmark includes numbers of heterogeneous processors and different jobs for completion. From the results, the proposed method can find more optimal solutions than related work.
Keywords
genetic algorithms; job shop scheduling; advanced solution extraction; executing time; flexible job shop problem; minimal critical machine workload; multi-objective genetic algorithm; total workload;
fLanguage
English
Publisher
iet
Conference_Titel
Frontier Computing. Theory, Technologies and Applications, 2010 IET International Conference on
Conference_Location
Taichung
Type
conf
DOI
10.1049/cp.2010.0600
Filename
5632248
Link To Document