Research Of Blocking Flow Shop Scheduling Problem Based On Heuristic Algorithm

The traditional production scheduling environment assumes that there is an infinite buffer capacity between consecutive devices,and production will not be blocked,which is an ideal production state.However,in the actual production process,the buffer capacity between manufacturing equipment is limited,and will dynamically change with the constraints of manufacturing resources,and various types of blocking phenomena will inevitably occur,which will not only increase the final completion time of the workpiece,It will also cause more equipment resources to be idle and reduce production efficiency.The classic production management and scheduling methods are no longer suitable for the current production environment.The scheduling problem of the blocked flow shop considering the buffer capacity and the blocking situation between the equipment and the actual production situation Get closer and get more and more attention.Therefore,to study how to optimize the allocation of limited manufacturing resources with the optimal scheduling scheme in the scheduling problem of blocked flow workshops,to ensure the efficient and stable production process and improve production efficiency,has great application value and Practical significance.Taking the blocked flow workshop as the research object,in view of the problems and needs in the blocked flow workshop,a multi-objective optimized mixed block flow workshop scheduling model is established,and an improved heuristic algorithm is used to solve the scheduling model and finally determine the optimal scheduling plan.The research contents are summarized as follows:First,the research background and significance of this paper are described,the related problems and characteristics of production scheduling are analyzed,and the production scheduling is classified.The current status of research on the scheduling problem of blocked flow shop and heuristic algorithm is summarized.Then,the flow shop scheduling problem and the mixed block flow shop scheduling problem under different types of blocking constraints are analyzed,the contradictions and connections between the various scheduling sub-goals are studied,and the hybrid with multi-objective optimization with maximum completion time and equipment utilization is established Scheduling model of blocked flow shop.Secondly,an improved NEH(Nawaz–Enscore–Ham)heuristic algorithm is proposed to solve the scheduling model.New heuristic rules are established in the algorithm to generate the initial sequence.During the algorithm insertion process,a new Tie solution is proposed to avoid the appearance of Tie balance.At the same time,a fast neighborhood search method is introduced in the iterative calculation process to improve the efficiency of the algorithm.Finally,based on the established scheduling model of congested flow workshop,the actual case of the enterprise is simulated and analyzed,and the improved NEH heuristic algorithm is used to solve the scheduling model and comparative analysis is carried out,proving the superiority of the scheduling model and algorithm in this paper.