Research On Scheduling Problem Of Flexible Mixed Model Assembly Line With Process Priority Constraints

An assembly line is a form of production organization that completes all processes in a pipeline and converts them into a final product.By rationally organizing and sorting the assembly lines without changing or changing the production facilities,Reduce manufacturing costs and speed up production responsiveness.With the development of society,the assembly line has gone through a single assembly line that can only assemble one product from one assembly line to a mixed flow assembly line that can assemble multiple products with one assembly line.At present,Global Industry 4.0 aims to expand and enrich the services as much as possible in the manufacturing process,propose better and more complete solutions,meet the individual needs of consumers,and soften the manufacturing and personalization of the road.Therefore,this thesis takes the multi-functional assembly workstation and the full-featured assembly workstation environment as the background,constitutes the flexible mixed-flow assembly line,and analyzes the technical problems to be solved in the product assembly process in detail.Using genetic algorithm and neighborhood search algorithm,the research does not change.The problem of sorting flexible mixed-flow assembly lines under various process constraints under the length of the assembly line interval.This research has a strong reference value for intelligent assembly under Industry 4.0.Product sequencing and process sequencing have an important impact on the efficient operation of flexible hybrid assembly lines.In traditional management processes,the relationship between them is often fragmented.Therefore,independent product sequencing and process scheduling can not make the assembly line operation optimal.Based on the complexity of the sorting problem,this paper uses genetic algorithm to sort the products,uses neighborhood search for the process ordering,and then both.Combining,a new GA-LSM algorithm is formed,and the results of the algorithm are compared with the results of the CSO cat group algorithm.Conventional mixed-flow assembly line scheduling has an overload load for open workstations due to different assembly time per process for each product.For closed workstations,the assembly line needs to be stopped.In this paper,batch processing technology is adopted to schedule each batch,and the maximum time for solving is minimized.This has theoretical guiding significance for scheduling without load and without stopping,and has practical reference value for reasonable organization and scheduling of flexible mixed-flow assembly lines.This paper studies the sequencing problem of flexible mixed flow assembly lines.The effects of product delivery sequence and process sequencing on assembly time under flexible mixed flow assembly line were discussed,and the maximum time minimization model was established.Through three sets of cases--flexible mixed-flow assembly line scheduling with non-compact-priority constraint relationship,flexible mixed-flow assembly line scheduling with tight priority constraints,and flexible mixed-flow assembly line scheduling with close priority constraint relationship,the results show that GA-LSM algorithm Effectiveness and universality.