Research On Routing Buffer Scheduling Problem Of Passenger Car Manufacturing Workshop Based On Machine Price

The limited buffer in the production workshop of bus manufacturer is composed of several parallel lanes and electric flat carriages between the lanes.The to-be-processed buses in the buffer can be moved forward in the lane or moved in parallel by electric flat carriage,which is typical of routing networks.Due to the requirements of processing technology,it usually needs to implement setup operation which is the preparation of the workstation of the next process in the buffer for processing the next bus after it completes a bus processing.If setup-operation factors of buses processed in the same workstation is different,a extra time called setup-operation time will be added outside the processing time,which will increase the production time of processing buses.By adjusting the movement process of the buses in the routing buffer,get the buses with the same setup-operation factor be processed at the same workstation and reduce the times of setup operation,thereby reducing the influence of the setup operation in the production process,which increases the difficulty of scheduling in the bus manufacturing workshop with the routing buffer.In order to solve the above-mentioned scheduling optimization problem,this paper focuses on the characteristics of setup operation of the bus manufacturing workshop,and proposes a depth search routing rules with the minimum total setup cost to guide the movement of buses in the routing buffer.Based on this,a local fast optimization method of routing buffer based on SPF algorithm is proposed,and combined with global optimization algorithm to solve the scheduling optimization problem with routing buffer.The SPF algorithm takes the setup cost as the weight,and can find the minimum setup cost of each moving path of the bus in the buffer quickly.And obtain the optimal mobile solution of the bus in the routing buffer to reduce the computational complexity,local optimization time,global optimization time.The global optimization algorithm of this paper adopts the Improved Whale Optimization Algorithm(IWOA),which combines the Levy flight method and the reverse learning strategy with the standard whale algorithm to expand the diversity of the population and the optimization range,improves the ability of the whale algorithm to jump out of the local extremum,enhances the optimization performance of the algorithm.Finally,through multiple sets of example simulation tests,the optimization scheme of the local optimization method based on SPF algorithm combined with the global optimization algorithm based on improved whale algorithm is validated to solve the problem of scheduling optimization problem with routing buffer.The main research contents of this paper are as follows:(1)Establishing a scheduling problem model for bus manufacturing workshop with routing bufferBased on the classical finite buffer workshop mathematical programming model,the model elements of the route buffer constraint are added to establish a mathematical relationship model with routing buffer constraints.The research is based on minimizing the maximum completion time,total change time,local optimization time and The global optimization time is the evaluation index system of the optimization target,and further analyzes the flexible flow shop scheduling process with routing buffer.(2)According to the characteristics of the modification operation of the bus manufacturing workshop,a depth-first search rule based on the total cost of the change is established to guide the movement of the passenger car in the routing buffer.(3)The global optimization algorithm uses the Improved Whale Optimization Algorithm(IWOA),which adds two improvements of Levy flight and reverse learning strategies based on the standard whale algorithm,respectively expanding the diversity of the population.And the optimization range improves the ability of the whale algorithm to jump out of the local extremum and enhances the optimization performance of the algorithm.(4)In order to determine the optimal moving route of the passenger car in the routing buffer more quickly,a local fast optimization method based on SPF algorithm is proposed.Taking the cost of changing the parking space as the weight of the SPF algorithm,it can quickly find the minimum change cost of each moving path of the bus in the buffer,get the optimal mobile solution of the bus in the routing buffer,and reduce the computational complexity.The local optimization time is reduced,thereby reducing the global optimization time,and the global optimization algorithm is combined to solve such scheduling optimization problems more effectively.Finally,through multiple sets of example simulation tests,the optimization scheme of the local optimization method based on SPF algorithm and the global optimization algorithm based on improved whale algorithm is validated to solve the problem of scheduling optimization problem with routing slow zone.