Research On Problem Of Multi-objective Flexible Job Shop Scheduling Optimization Based On Evolution Algorithm

Scheduling problem is an important research field at the enterprise production, and it exist abroad in the disperse and flow manufacturing, the muilt-objective flexible job shop scheduling(FJSP) is an important extension of classical job shop scheduling problem(JSP), which takes into account not only the flexibility of machine availability but also the different expectations from different departments, and it could more fit the need of the present manufacture system. Due to muilt-objective flexible job shop scheduling belong to NP problem, the student have not attempted seek the excellent solution in the multinomial time, but want to split the difference between the calculate time and purpose, try for getting near excellent or satisfaction solution in a lesser time, most students use elicitation way to solve the problem. Evolving algorithm have a broad attention in present research of the problem.Article use the evolving algorithm combining local searching to solve the muilt-objective flexible job shop problem. First,on the basis of the technical review on the domestic and foreign research, analyzing the research of the muilt-objective flexible job shop scheduling, next introduce the basic theory of the algorithm which would used, then aim at the most attention target in the realism, establish mathematics model, design a resolvent based on evolving algorithm. Finally, providing standard and practice case study to illustrate the feasibility and effectiveness of proposed method.This thesis mainly finishes the following works:First, Directing against the most attention target in the realism, the multi-objective flexible job shop scheduling problem optimization model was built, where makespan and equipment utilization rate were all concerned.Second, aiming at improving searching efficiency and searching quality, improve evolution algorithm combining both advantages of local searching and evolution algorithm is presented,and have a particular design on the operation of the algorithm when it used on the muilt-objective flexible job shop problem.Finally, A simulation experiment is carried out to illustrate that the proposed evolution algorithm could solve the multi-objective flexible job shop scheduling problem effectively. Providing standard and practice case study to illustrate the rationality of proposed method.