This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 3
Maui, Hawaii
January 03-January 06
ISBN: 0-7695-0981-9
In our recent research, we showed results of the comparative study on effects of using several kinds of scheduling evaluation criteria as the fitness function of a genetic algorithm for job-shop scheduling. From these results, we obtained that the idle time criterion sometimes can provide a good makespan-minimizing schedule for a job-shop scheduling problem. In this paper, according to the above results, we propose a symbiotic genetic algorithm. The symbiotic genetic algorithm is structured with two kinds of evolution processes, i.e., (1) a co-evolution process in which both makespan and idle time schedule criteria are employed as the fitness functions into the operation-based genetic algorithm for job-shop scheduling, and (2) a sub-evolution process in which the total job waiting time schedule criterion is used as the fitness to provide high diversity for chromosome population. The symbiotic genetic algorithm tested on famous benchmark job-shop scheduling problems. Further, we introduce the concept of software system for job-shop scheduling based on the proposed method.
Index Terms:
Genetic Algorithm, Job-shop Scheduling, Symbiotic Mechanism
Citation:
Y. Tsujimura, Y. Mafune, M. Gen, "Effects of Symbiotic Evolution in Genetic Algorithms for Job-Shop Scheduling," hicss, vol. 3, pp.3026, 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 3, 2001
Usage of this product signifies your acceptance of the Terms of Use.