Research On Job Shop Scheduling Problem Based On Adaptive Differential Simulated Annealing Algorithm

Job-Shop Scheduling Problem(JSP)is the most classic type of shop scheduling problem.The study of this problem can help enterprises improve production efficiency and enhance their management capabilities.The main characteristic of job shop scheduling problem is that the processing time and process of each workpiece are different,and each process has only one equipment,which is a typical NP-Hard problem,so it is very important to study the method of solving such problems.This paper focuses on the static job shop scheduling and dynamic shop scheduling problems,and analyzes the advantages and disadvantages of Differential Evolution Algorithm(DE)and Simulated Annealing Algorithm(SA).Adapt to the differential annealing algorithm.The details are as follows:Firstly,a study is made on the Job-Shop Scheduling Problem(JSP),the characteristics of the problem are analyzed,and a mathematical model is established with the goal of minimizing the maximum completion time.Secondly,based on the characteristics of job shop scheduling problems,a process-based coding method is used to code the processes.Due to the limitations of the single algorithm,an adaptive differential annealing algorithm is proposed.The advantages and disadvantages of the differential evolution algorithm and the simulated annealing algorithm are complementarily combined,and an adaptive mutation operator and a jumping mechanism are introduced to improve the search ability and effectiveness.The design experiments demonstrate the effectiveness of the jumping mechanism,and compare the results of other literature algorithms with cases of different scales to illustrate the superiority of the adaptive differential annealing algorithm.Thirdly,this paper discusses the dynamic scheduling problem based on the original static problem.For general insertion behavior and insertion behavior with priority,this method uses a combination of adaptive differential annealing algorithm and rolling window technology.Two problems are solved,and a general scheduling scheme and a scheduling scheme with priority are given.Fourthly,the problems studied in this thesis are compiled into job shop scheduling software using MATLAB GUI,which is convenient to use.Finally,the work of this paper is summarized,and several directions for further research on this kind of problem are proposed.