The Research And Application Of Job-Shop Scheduing Based On The Genetic Algorithm

The Job-Shop Scheduling Problem (JSSP) is one kind of typical Scheduling NP problem. The goal of settling this problem is to find solutions that arrange a group of arrangement to the machine to finish them best. The enterprise can make the production with high efficiency, high flexibility and high reliable.Firstly, by the description of the Job-Shop Scheduling system, the paper introduced the theory about Genetic Algorithms. This paper Elaborated the algorithm's basic structure and proposed own Genetic Algorithms encoding, adaptive function selection, the algorithm parameter selection, the self-adaptive mutation and the crossover operator design. Secondly, according to the insufficiency of Genetic Algorithms the paper introduced the Simulated Annealing Algorithms. And it also proposed the hybrid Genetic Algorithms on the basis of the advantages and disadvantages of the two algorithms. Thirdly, according to the situation which in the basis actual workshop work dispatch production possibly appears, initially discussed how realized the workshop work dynamic dispatch question. Finally proposed the Job-Shop Scheduling system design method, and showed the hybrid Genetic Algorithms is feasible by two examples in this article.