期刊名称:International Journal of Computer Science & Technology
印刷版ISSN:2229-4333
电子版ISSN:0976-8491
出版年度:2011
卷号:2
期号:2(Version 1)
出版社:Ayushmaan Technologies
摘要:Scheduling in many different areas is a ‘NP-complete’ problem. i.e. algorithms that implement scheduling require exponential time to reach a solution. These problems require innovative solutions. Genetic algorithms can be used for finding innovative solutions for scheduling. This Paper contains how we can use genetic algorithm in finding an innovative solution for CPU Scheduling. Using an efficient encoding, and designing appropriate crossover and mutation operators for our problem may achieve this. The algorithm requires a population of individuals. Each individual is an encoded version of a proposed solution. The algorithm consists of the evaluation of individuals, selection of individuals, which will contribute to the next generation, recombination of the parents by means of crossover, mutation and other operators to produce a new generation.