Solving Job Scheduling Problem Using Genetic Algorithm

The efficient scheduling of independent computational jobs in a computing environment is an important problem where there are some deadlines for each job to become complete. Finding optimal schedules for such an environment is (in general) an NP-complete problem, and so heuristic approaches must be used. Genetic algorithms are known to give the best solutions to such problems. The purpose of this paper is to propound a solution to a job scheduling problem using genetic algorithms. The experimental results show that the most important factor on the time complexity of the algorithm is the size of the population and the number of generations.