Research On Multi-workshop Flexible Integrated Scheduling Algorithm Considering Migration And Double Objectives

In the actual manufacturing industry,there are not only machining problems,but also assembly problems.The comprehensive scheduling is to unify the processing equipment and assembly equipment into resource equipment,and the constraint relationship between each process is represented by the form of processing process tree,so that the assembly constraint can be considered in the scheduling production.The existing research on integrated scheduling is generally single workshop internal scheduling,second workshop integrated scheduling,multi-workshop integrated scheduling,flexible job shop integrated scheduling,a few studies involve multi-workshop flexible integrated scheduling.And the problem of product migration in the process of processing is almost not involved.The characteristic of machining process on flexible equipment is that a process can be processed on different equipment,and the processing time and cost are different.The multi-shop scheduling is characterized in that the processing equipment is dispersed in a plurality of workshops with different geographical locations,which makes it difficult to form better global benefits for the cooperative manufacturing of the multi-workshop flexible equipment.Therefore,this paper mainly studies the multi-workshop flexible integrated scheduling problem considering migration double objectives.In this paper,a multi-workshop integrated scheduling algorithm based on K shortest path is proposed to solve the multi-workshop flexible integrated scheduling problem considering the migration of two objectives.Firstly,the algorithm is based on the location information of multiple workshops.A simple network structure diagram is constructed,and then the attribute information of each processing equipment is compared and analyzed,so as to select the best,according to thedifference of the objective function.Combining Prim minimum spanning tree algorithm and Dijestra shortest path algorithm to solve M alternative optimization paths in network graph under different objectives,then a weighted sum method is proposed to compare multiple critical paths.To get the end.The optimization result of.The example results show that the multi-workshop integrated scheduling problem can be solved.Secondly,a multi-workshop integrated scheduling algorithm considering migration double objectives is proposed in this paper.Firstly,the leaf nodes of the process tree are regarded as the schedulable process set,and secondly,the pre-scheduled process set is determined according to the long path priority strategy and the short time strategy.Then the actual scheduling process set of the same idle equipment is determined according to the process selection strategy of the same equipment in the workshop.Finally,considering the migration time and cost of the process to be processed,a two-objective optimization strategy for process workshop selection is proposed.The example results show that the multi-job shop integrated scheduling algorithm considering migration double objectives can be well solved.In the end,a multi-shop flexible comprehensive scheduling algorithm considering the migration of two objects is proposed in this paper.Firstly,aiming at the two problems of migration constraint and device resource constraint,a disjunctive graph model considering the migration and the equipment resource problem is designed;secondly,only a single target is given priority to be scheduled in the scheduling process,the problem of the deviation of the scheduling result is solved,and the attribute fusion strategy is designed,Such that the selected path attribute values are more balanced.The example results show that the proposed algorithm can reduce the influence of the time and cost spent in the migration process on the total time and total cost of product scheduling,and can obtain the scheme with high total time and total cost performance price of product scheduling.