Design And Optimization Of Multi-objective Flexible Job-shop Scheduling Methods Of Non-close-joining Operations

The workshop scheduling is an important factor affecting the production efficiency of the manufacturing industry.The multi-objective flexible scheduling problem makes the scheduling model more suitable for the actual production environment.However,the existing scheduling model often does not take into account the convergence problem between job processing processes,resulting in the optimization of the objective function model is often too ideal,the data statistics ignore the workpiece transport and processing preparation,data processing relative to the actual production process is intermittent,The solution is difficult to get rid of the actual situation of production scheduling.Therefore,it is of great theoretical and practical value to study the multi-objective scheduling of the job shop in consideration of the non-close convergence of the processes.First of all,it confesses the research background and significance of the subject,summarizes the research results in recent years,and discusses the development trend of the problem by analyzing the existing problems.The paper summarizes the theoretical research of shop scheduling problem and multi-objective optimization problem.Based on the analysis of the production characteristics of the non-close operation workshop,the process is defined and classified,and the scheduling strategy based on the process and the fast non-dominated sorting algorithm is proposed respectively for the inter-process convergence operation.Secondly,based on the improvement of the existing genetic algorithm(NSGA-II),the scheduling algorithm of multi-objective scheduling problem for dynamic workshop with non-close convergence process is given.The elite retention strategy is designed in detail,which ensures the diversity of population distribution,But also to ensure that the evolution of the population more practical significance.The multi-index decision-making technique AHP is used to obtain the optimal scheduling scheme from the Pareto solution set.And through the example verification,it is shown that the proposed improved scheduling algorithm can solve the multi-objective scheduling problem in the non-tight interface process more practically.Finally,based on the background of real enterprise production and processing,the mathematical model of flexible job shop scheduling is established with the maximum completion time and the lowest production cost and the lowest processing failure rate.The multi-objective scheduling algorithm of classical workshop and the proposed The scheduling algorithm is used to solve the scheduling algorithm respectively.Through the comparison and analysis of the scheduling results,the feasibility and superiority of the scheduling method are verified.