Research On Job-shop Scheduling Problem Based On Genetic Arithmetic

Multi-product and small-batch production which is made to order will be the main production mode of 21 century. Correspondingly, manufactory is on the development to lean production and agile manufacturing. In this condition, how to plan and schedule becomes the key issue to make the manufacture process smoothly and efficiently. It is very important to research on effective scheduling and optimization to improve productivity and reduce cost. So more and more researchers pay attention to this research.On the basis of the technical review on the domestic and foreign research, this thesis has an extensive and systematic study on the job-shop scheduling combining the actual job-shop operation.Firstly, the thesis studies the flexible job-shop optimal scheduling problem in FMS on analyzing the weakness of classical job-shop. And then, considering multi-objective of shop scheduling and just-in-time production, the mathematical model of flexible job-shop scheduling (FJSS) for bi-objective is established. At the same time, a modeling example is given combining Kailing project.Secondly, to solve this model, a genetic algorithm is developed. On the basis of dissertating the fundamental conception, principle and method of Genetic Algorithm, the paper designs this algorithm detailedly to apply it to flexible job-shop scheduling optimization. At the same time, the digital computation result is given.Finally, because the job-shop scheduling is stochastic, dynamic and complicated, the paper studies the dynamic job-shop scheduling deeply. Then the realization project of dynamic job-shop scheduling is presented and a simulation example is given. Lastly, this paper analyses and designs the dynamic job-shop scheduling system using the object-oriented analysis method.