Research On Flexible Work Shop Scheduling Problem With Multiple Time Factors Based On The Mixed Particle Swarm Optimization

Since China's entry into the WTO,the degree of foreign development in our country is getting bigger and bigger,and the competition pressure between the companies is mounting.Therefore,for the sustainable development of enterprises,Reducing costs and energy consumption,improving resource utilization and improving production efficiency have become the goals that enterprises continue to pursue and explore.Effective production scheduling has an important influence and significance on enterprises to achieve these goals.Therefore,since the 19th century,the research on production scheduling technology and algorithms has become a hot topic for scholars to study.In the nineteenth century,the research on production scheduling problems mainly focused on the research of classical scheduling problems.This often simplified the environment of production,so its research results are difficult to apply in the actual workshop environment.After the 21st century,more research on generating scheduling problems focuses on the scheduling problems in complex production environments.The flexible job shop scheduling problem talking into account multiple time factors is discussed.This problem not only considers the fact that each workpiece has multiple processing routes,but also takes into account the transfer transportation time of the workpiece between the processing equipment,which is closer to the actual production of the enterprise.So it has profound meaning in theory and fact for its research.Considering the advantages of easy realization and good memory ability of particle Swarm,a kind of special particle swarm optimization algorithm is developed to solve this problem.First,the algorithm uses heuristic initialization method to initialize particle Swarm.The problem of unevenness in the distribution of random initial solutions is solved,and the quality of initial solutions is effectively improved.In this paper,a new method of particle renewal is proposed to generate a potential solution to the problem and ensure the convergence speed of the algorithm.At the same time,a local search strategy is proposed to solve the problem that the particle swarm algorithm has weak local search ability.Finally,this paper uses MATLAB R2014a software to write the program,and obtains the corresponding Gantt diagram,which means the algorithm is effect.