This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 International Conference on Computational Intelligence and Security
An Improved Genetic Algorithm for Job Shop Scheduling Problem
Nanning, Guangxi Zhuang Autonomous Region China
December 11-December 14
ISBN: 978-0-7695-4297-3
Job shop scheduling problem is a typical NP-hard problem. In this paper, new designed crossover and mutation operators based on the characteristic of the job shop problem itself are specifically designed. Based on these, an improved genetic algorithm is proposed. The computer simulations are made on a set of benchmark problems and the results indicate the effectiveness of the proposed algorithm.
Index Terms:
Genetic algorithm, Job shop scheduling problem, Crossover oprator, Mutation operator
Citation:
Ren Qing-dao-er-ji, Yuping Wang, Xiaojing Si, "An Improved Genetic Algorithm for Job Shop Scheduling Problem," cis, pp.113-116, 2010 International Conference on Computational Intelligence and Security, 2010
Usage of this product signifies your acceptance of the Terms of Use.