Research On Flow Shop Scheduling With Buffer Based On Improved Ant Colony Algorithm

Since the 21st century,flow shop scheduling,as a complex combination of production mode,has been the focus and hot spot in academia and business circles,and a lot of research results and progress have been made in this aspect.But in terms of the present research status in our country,there are many enterprises running water shop scheduling is a simple combination of production mode,namely the parts for next production assembly before the parts are based on the prepared parts,and the parts have no buffer space and make the production machines and equipment load,production completion time too long lead to time cost waste and so on problems.There are few researches on shop shop scheduling problems in this mode,especially hybrid flow shop scheduling problems with limited buffer constraints.It is of practical significance to use intelligent improved algorithm to solve these problems.Therefore,in this paper,an improved ant colony algorithm is proposed based on the actual situation of the production line of enterprises,and it is applied to the flow shop scheduling system（LBFSSP）with limited buffer.Firstly,the background,purpose and significance of the research topic of this paper are put forward,the research status of flow shop scheduling system and ant colony algorithm with limited buffer are summarized and analyzed,and the content structure and technical route of this paper are introduced.Secondly,a single-line LBFSSP model is constructed and the buffer effect is analyzed.Then a hybrid LBFSSP mathematical model is constructed.This kind of production system scheduling problem includes the capacity design of the limited buffer and the optimization of the total production cycle of the entire production system.Considering the buffer capacity and production cycle of the sub-production line and the assembly line,a model with the optimal buffer capacity and the minimum completion time is established.On this basis,the LBFSSP is studied and optimized.Then,in order to solve these problems,the ant colony algorithm is proposed as the global optimization algorithm.Proposed algorithm improvements based on the principles,strengths and weaknesses of the ant colony algorithm.On the pheromone update rule,the iterative optimal solution is used to update the pheromone concentration in stages to prevent the local optimization of the algorithm and improve the global optimization ability of the algorithm.An increasing parameter is introduced q₀ into the rule of state transition.By comparing with the original parameter q,the transition of the next processing procedure has a certain probability,so as to solve the shortcoming of slow convergence of the algorithm.The algorithm is designed for the capacity with buffer limit and the total production cycle.The improved ant colony algorithm is designed to encode and decode hybrid LBFSSP.Finally,taking a company’s automobile shock absorber production assembly line as an example,MATLAB is used to write,debug and run the program.The effect of the optimal solution calculated by the algorithm is better than the original sorting result of the enterprise.The problem of the optimal buffer capacity and the maximum production cycle of the hybrid LBFSSP is solved.The performance of the improved algorithm is verified by comparing the improved algorithm with the original algorithm.