DocumentCode :
1571204
Title :
An improved genetic algorithm for JSP
Author :
Xiong, Weiqing ; Wei, Ping ; Zhao, Jieyu
Author_Institution :
Inst. of Comput. Sci. & Technol., Ningbo Univ., China
Volume :
4
fYear :
2004
Firstpage :
2985
Abstract :
According to the character of JSP, the paper designs a matrix coding for its population as well as relevant crossover operator and mutation operator. The algorithm adds a way to replace the lethal factor with the best individual for its reproduction strategy, and a heuristics correct operator is designed. Solving two different kinds of JSP model result in satisfied.
Keywords :
computational complexity; genetic algorithms; job shop scheduling; NP-complete problem; genetic algorithm; job shop scheduling problem; matrix coding; mutation operator; relevant crossover operator; Algorithm design and analysis; Genetic algorithms; Genetic mutations;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on
Print_ISBN :
0-7803-8273-0
Type :
conf
DOI :
10.1109/WCICA.2004.1343065
Filename :
1343065
Link To Document :
بازگشت