Flow Shop Scheduling Based On Flower Pollination Algorithm

The problem of production scheduling means how to arrange and allocate limited resources reasonably within a given time constraint so that one or more goals can be optimized.The problem is widely existed in the manufacturing industry,textile industry,pharmaceutical industry and food production industry.As the most important problem in enterprise production,the scheduling problem has always been a hot research issue.How to obtain a reasonable and effective scheduling plan has very important theoretical value and practical significance for the development of the enterprise.Flow shop scheduling is a classic scheduling model simplified according to the actual production scheduling.This problem is most similar to many actual production processes.Therefore,it is important to research the flow shop scheduling problem.The specific work has the following four aspects:(1)Analyzed the flower pollination algorithm comprehensively which is a new intelligent optimization algorithm proposed in 2012.Detailedly introduce the basic principle and its implementation steps.The test function is used to test the performance of the algorithm.Analyzed the disadvantage of the algorithm in solving the flow shop scheduling problem and gave optimization suggestions.(2)Establish the mathematical model of the permutation flow shop scheduling problem which is the most widely used in the flow shop problem.This article proposes an improved flower pollination algorithm.First,new coding and decoding rules are adopted;and by improving the initial solution quality and local search strategy enable the algorithm to effectively avoid falling into local optimality and premature algorithms.The simulation of a large number of examples of different scales shows that the algorithm proposed in this chapter has better convergence,and the quality of the solution is higher,which proves the effectiveness of the improved strategy.(3)Establish the mathematical model of the no-wait flow shop scheduling problem which is another common type of flow shop problem.According to the characteristics of discretization of this type of problem,a discrete flower pollination algorithm is proposed.The algorithm is discretized by redefining the global pollination operator,local pollination operator and Lévy flight,which is suitable for the problem of zerowait flow shop scheduling.And through a large number of simulation examples of different sizes,it shows that the algorithm proposed in this chapter has better convergence and obtains more accurate optimization results.(4)The problem of energy-saving scheduling of steel heating furnace is a kind of actual workshop scheduling problem.Establish the mathematical model with the optimization goal is minimizing the total time of all slabs to be heated in the furnace after reaching the rolling temperature combined with its production process constraints.And further designed a flower pollination algorithm based on two types of neighborhoods: furnace replacement operation and position exchange operation.Simulation experiments were carried out on slabs of different scales,which proved the effectiveness of the algorithm on the problem of furnace scheduling.