| With the development of high-tech strategic plans such as "Made in China 2025","German Industry 4.0",and "Internet +",China’s manufacturing industry is continuously developing towards high speed,high quality,and intensiveness by improving the informatization level of enterprises.An efficient production scheduling plan can not only improve product productivity,equipment utilization rate and shorten product production cycle,but also improve the economic efficiency,productivity and competitiveness of enterprises.Research on efficient production scheduling optimization technology is indispensable to the manufacturing industry.Therefore,the thesis has conducted in-depth research on job shop scheduling.First,this article mainly introduces the background and significance of the subject research,summarizes the current research status of job shop scheduling problems,analyzes the advantages and disadvantages of existing research content,and then puts forward the content of this research.The fusion path relinking,genetic algorithm,tabu search algorithm and neighborhood structure are designed to solve the traditional job shop scheduling problem.In the second chapter,this section briefly describes the traditional job shop scheduling problem,and gives a mathematical model.Then,it describes the basic process and characteristics of genetic algorithm,neighborhood search algorithm,tabu search algorithm and path relinking algorithm,which lays a foundation for the subsequent construction of hybrid algorithm.In the third chapter,a hybrid algorithm combining reverse solution-directed path relinking is proposed to solve the job shop scheduling problem.In this chapter,the process-based coding is used in the genetic algorithm to realize the global search process,and the neighborhood search algorithm based on the neighborhood structure is used to implement the local search process of the algorithm.In order to make up for the shortcomings of the algorithm at this time,the path relinking combined with the inverse solution is used to further search,and the effectiveness of the algorithm is verified by the experimental test results.In the fourth chapter,a path relinking design based on different scheduling types is proposed to solve job shop scheduling problems.First of all,different scheduling types are analyzed,and the current solution is selected as the initial solution for path relinking.The current solution is fixed as the direct solution of path reconnection,which is the forward and reverse scheduling without delay.In the process of path relinking,path relinking is carried out according to the processing position of the initial solution and the guide solution in each process of the machine.Finally,the effectiveness of the improved algorithm is verified by the experimental test results.In the fifth chapter,based on the previous theoretical research results,and combined with practical cases,a software prototype system of hybrid algorithm for path relinking fusion is designed.The main function modules of the prototype system are introduced,and the whole operation process of the prototype system is introduced by testing the enterprise case,which verifies its effectiveness.Finally,the work of this thesis is summarized and the future research directions are prospected. |
