Application On Job-Shop Scheduling Method Based On Mixed Genetic Algorithm

Along with the development of economy and the transformation of the production mode, the production planning and resource assignments are becoming more complicated. In the competition environment of nowadays, how to use the computer technology to realize the production scheduling optimization has attracted extensive attention. Because of the superiority in solving complex combination optimization questions of Genetic Algorithm, Genetic Algorithm has been introduced into the research of job-shop scheduling questions.In this paper, based on the combining of job-shop scheduling and the merit of Genetic Algorithm (GA), Simulated Annealing (SA) and Tabu Search (TS) Algorithm, it designed a kind of mixed genetic algorithm, which can be applied in job-shop scheduling. And it realized the job-shop scheduling system. It showed a method of creating initialization population and avoided the unreasonable individual. It introduced SA and TS into the genetic operation mechanism, got over the shortage of GA in job-shop scheduling optimization. It showed the superiority of mixed genetic algorithm by using emulator. At the same time, the running result of the system settled for the scheduling demand and ulteriorly proved the validity and practicability of the algorithm.