Research On Integrated Scheduling Algorithms Of Second Workshops With Subtree Process Set Conflict Adjustment

With the rise of product personalization,the mass production method of manufacturing has gradually withdrawn from the mainstream market.DIY culture has been more and more popular in design.To meet the needs of mainstream personalization,multi-variety,small batch production is worth studying.Although many results have been achieved in the study of comprehensive scheduling problems,there is currently no consideration for the conflict adjustment of the subtree process set,so this paper studies the conflict adjustment of the subtree process set.Aiming at the problem that the process set formed by split process tree enters the pre-adjustment sequence to produce the conflict with the processing time of the equipment process,a comprehensive scheduling algorithm for the conflict adjustment of the subtree process set is proposed.When the new process set is inserted into the pre-adjusting alternative set in scheduling order,if the process location conflicts,the last process of the new insertion is moved forward until the completion time of the last process is equal to the pre-scheduling time of the current process set.All the pre-processes are dynamically adjusted to select the optimal results in the moving process.The last procedure of the newly inserted process set is moved backward until the equipment has no scheduling process,the optimal results are selected for dynamic adjustment of all its optimal results.In turn,the subtree process set is merged according to this method,so as to determine the process processing order and complete all processes as soon as possible.The example shows that this algorithm solves the single-shop comprehensive scheduling problem with the conflict adjustment of the subtree process set,which has theoretical and practical significance.Aiming at the problem of symmetric two-workshop integrated scheduling with subtree conflict regulation,a symmetric two-workshop integrated scheduling algorithm in subtree conflict regulation is proposed.In order to solve the problem of balanced allocation of subtrees in the second workshop process set,this algorithm puts forward the pre-allocation strategy of subtrees process set.All subtrees in the sub-tree power formed by splitting the subtrees are evenly distributed to the two workshops according to the serpentine sorting rule,then,in order to improve the utilization rate of the second workshop equipment and reduce the transfer of the process,the pre-distribution strategy of the process on the workshop equipment is designed.The process of overload equipment on the equipment set of the two workshops is transferred to the other workshop.On the basis of satisfying the balance of the workshop,the utilization ratio of the equipment is further improved and the migration of the working procedure is reduced.Aiming at the problem of asymmetric second workshop integrated scheduling with subtree conflict regulation,an asymmetric second workshop integrated scheduling algorithm in subtree conflict regulation is proposed.The algorithm is first cut by cutting all subtrees in subtree power with special processes,update current tree power.A neighborhood selection strategy for sub-tree process set workshop is proposed to solve the problem of balanced distribution of sub-tree process set workshop.Then the first pre-adjustment of the current workshop is carried out using the subtree process set conflict adjustment strategy.Finally,the paper puts forward the strategy of equipment balance in asymmetric second workshop to adjust the process of equipment on the equipment set of two workshops across workshops,the minimum scheduling time to reduce the migration of the process,to achieve the purpose of reducing the final processing time.In this paper,the problem of integrated scheduling with sub-tree process set conflict regulation is studied,and the integrated scheduling algorithm between bicycles,symmetric two workshops with sub-tree process set conflict regulation and asymmetric two workshops with sub-tree process set conflict regulation are proposed.An example shows that the proposed algorithm has some theoretical and practical significance in solving the problem of comprehensive scheduling with subtree process set conflict adjustment.