DocumentCode
508350
Title
A New Genetic Algorithm in Job-Shop Scheduling
Author
Guiyu, Li ; Hongzhen, Mao ; Dongfang, Zhao
Author_Institution
Inst. of Math. & Stat., Huazhong Normal Univ., Wuhan, China
Volume
4
fYear
2009
fDate
14-16 Aug. 2009
Firstpage
98
Lastpage
102
Abstract
In this paper, a new genetic algorithm is proposed to solve a kind of job-shop scheduling problem (open type). The difference of the new algorithm and the classic genetic algorithm is mainly on how encoding. Via some theory in modern algebra, we also prove that the new algorithm is necessity and workability and give out a detail method of encoding and mutation. At last through an example of satellite scheduling we work out an optimal solution by the new algorithm.
Keywords
algebra; encoding; genetic algorithms; job shop scheduling; encoding; genetic algorithm; modern algebra; open type job-shop scheduling; satellite scheduling; Algebra; Artificial satellites; Encoding; Genetic algorithms; Job shop scheduling; Packaging; Processor scheduling; Satellite communication; Satellite ground stations; Scheduling algorithm; Cycle; Genetic Algorithm; Satellite Communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2009. ICNC '09. Fifth International Conference on
Conference_Location
Tianjin
Print_ISBN
978-0-7695-3736-8
Type
conf
DOI
10.1109/ICNC.2009.369
Filename
5366897
Link To Document