Research On Integrated Scheduling Algorithm Of Multi Workshop Process Group Division And Optimization Of Brothers

Scheduling in order to complete certain tasks and time allocation of resources used in common, and integrated scheduling is a scheduling single piece machining and assembly of complex products are processed together, in which case the process each step of the assembly seen as a special the process will step up the harmonization of processing and assembly, the use of inherent parallelism relationship between processing and assembly, improve production efficiency, bring more economic benefits for the enterprise.Since there are only a by product of integrated scheduling process scheduling tree path length determines the order process, the processing time is easy to start the process leading to a multi-step immediately before the delayed impact of the products in question total processing time, the paper proposed for this problem based on dynamic critical path law brothers step into a comprehensive set of scheduling algorithm. The scheduling algorithm based on dynamic critical path method comprehensive is put forward which schedules brother processes as a group. The algorithm according to the process attribute divides processes with the same predecessors into brother groups, and then according to the dynamic critical path method selects a process from the scheduling processes. When the brother groups are all the scheduling processes, the group is scheduled according to the priority of the group processes. When the processes of group are not all the scheduling processes, the brother group marked as suspending brother group and waiting for processing, until processed of the pending operation group all become the scheduling process. Brothers step into the Group Policy of the algorithm proposed by the group as soon as possible to dispatch a multi-step brothers step immediately before, immediately before the process can advance more processing to achieve the purpose of shortening product time to complete.For the problem of the integrated scheduling algorithm of lack of a universal adjustment optimization algorithm, integrated scheduling algorithm of the urgent process batches forward was proposed. The algorithm in other integrated scheduling algorithm to determine the initial products in each process of start processing time, batch search moving forward the process and to determine the moving forward the process of the forward position, try will be moving forward the process of the forward to the stretching position and adjust by the advancement of subsequent working procedures, records after the group of the forward product completion time and get the new scheduling order, if forward than do not forward completed earlier, it will forward after the completion of the scheduling sequence replacement without forward scheduling order. The example shows that the optimization algorithm has more extensive applicability and better solution to the integrated scheduling problem. Because each batch of advance algorithm to retain only completed with the shortest scheduling order and subject to adjustment affect subsequent step forward, so that the algorithm can process without damaging the binding between further shorten completion times.For conventional multi-shop integrated scheduling algorithm does not consider the constraint relationship between the brothers step may cause the product to extend the total processing time of issue, consider a group of multi-step brothers shop integrated scheduling. The algorithm takes into account the workshop process requires more co-processed, the processing involved in each step of the migration process and brother workshop group scheduling problem with pre-scheduling policy and brothers step into a group policy, try to group scheduling process, each step is selected workshop on better scheduling effect, the algorithm can shop more integrated scheduling optimization algorithm time without increasing the complexity of the situation. Finally, verify the solution of this algorithm integrated multi-shop scheduling problem has a broader applicability and better use case analysis.