Genetic Algorithm Method And Its Applications To Job Shop Scheduling Problems

Job shop scheduling is not only a representative problem of NP-hard, but also a very active and popular subject researched by many scholars, which has been paid close attention to by both academia and industry. The study of job shop scheduling has double significance in theory and realism.This dissertation focuses on genetic algorithms and their applications in job shop scheduling. Genetic algorithms are used to solve job shop scheduling problems. This paper has discussed the scheduling of 9 parts in 5 machines, 10 parts in 5 machines and 30 parts in 10 machines, and compared the results with that got from heuristic algorithms. This paper has testified the validity of genetic algorithms used in solving job shop scheduling problems.All results presented in this dissertation have very good effect on job shop scheduling. They are effective supports in working out a scheduling planning for the scheduling department of production enterprise. The search on job shop scheduling problem has very important value in theoretical significance and application value.