Application Of Improved Firefly Algorithm In Permutation Flow Shop Scheduling

The Permutation Flow Shop Scheduling Problem(PFSP)is an important branch of the flow shop scheduling problem.PFSP is a very typical NP problem.In the actual production process of an enterprise,the replacement flow shop scheduling problem is very common.Therefore,the research on it is of great significance.On the one hand,it can reduce the cost of investment,on the other hand,it can also improve the production efficiency of the enterprise,thereby bringing better economic benefits to the enterprise.The research on the replacement flow shop scheduling problem has attracted more and more attention from experts and scholars.In recent years,many new swarm intelligence optimization algorithms have been proposed,which can effectively improve the quality of solving replacement flow shop scheduling problems.As a swarm intelligence algorithm,the firefly algorithm is favored by experts and scholars,and it has always been one of the fields that people generally study.The firefly algorithm has a good ability to find local optimal solutions and global optimal solutions,and the algorithm process can be executed at the same time,thereby saving optimization time.However,the algorithm itself has some disadvantages.For example,the ability to find a balance between the local optimum and the global optimum is weak,and the convergence speed during the position iteration process is very slow.Aiming at these shortcomings,this paper improves the standard firefly algorithm,and improves the algorithm’s optimization ability by controlling the parameters γ and ξ.At the same time,because the workshop scheduling problem is a discrete function problem,it plays a very important role in process scheduling after using a specific coding method to discretize the algorithm.Compared with the application of standard firefly algorithm in workshop scheduling,the improved algorithm is better and the maximum completion time is shorter.For the algorithm proposed in this paper,a simulation experiment is carried out with an example,and a comparative analysis is carried out with related literature algorithms.Experimental results show that the algorithm has certain advantages in the convergence speed of scheduling.Finally,design and develop a workshop scheduling management system,and apply the improved algorithm to it,verifying the feasibility of the algorithm in practical applications.