Research On Integrated Scheduling Algorithm With Three Workshops Based On The Finishing Time Of Migration Process

As the development of integrated scheduling research towards to solve theproblem of more practical, research has shifted from single workshop to morecomplex distributed scheduling of more workshops. Although, at home andabroad, there have been a lot of researches about single shop scheduling anddistributed scheduling, but achievements appear less in view of the integratedscheduling.Aiming at that the problem that how to effectively allocate the complexproducts into two workshops with the same equipment resources, integratedscheduling algorithm of two symmetry workshops taking the finishing time ofmigration process is proposed. In order to consider all the factors of affecting thefinishing time of product, the thought of quantifies the migration time is proposed;in order to achieve the end of product processing as soon as possible, the strategyof the minimum finishing time of migration process is proposed, then the earliestcompletion process is chosed to distribute into two workshops after calculatingthe migration time evenly.Aiming at that the problem that the past two same workshops integratedscheduling algorithm didn’t take the finishing time of migration process intoaccount and cannot solve general asymmetric two workshops scheduling,integrated scheduling algorithm of two asymmetry workshops taking thefinishing time of migration process is took into account. The algorithm sortsprocesses according to the method of the dynamic critical path, and processeschoose the workshop in sequential. Then the strategy of the minimum end time ofmigration process is designed and adopted when proceses choose the workshop, the special process is assigned to fixed workshop, and the ordinary processeschoose the workshop according to the earlier completion time of calculating themigration time.Because the integrated scheduling algorithm of two symmetry workshopsbased on the finishing time of migration process can’t involve more workshops.To solve the more common workshop scheduling problem better, the integratedscheduling algorithm of three workshops based on the finishing time of migrationprocess is put forward. The algorithm sorts the processes according to the DCPMand chooses the workshop for them according to the order. When choosing theworkshop, the design is based on the minimum strategy for the end time of themigration process and the balance of efficiency strategy for the equipment. First,calculating the migration time and choosing a workshop can complete earliest. Ifthis way can’t solve the problem, the balance of efficiency strategy for theequipment is used. According to the ratio of the sum of all the processing timeand the latest end time to distribute the workshop.The instance shows that, thealgorithm not only has the complexity within two times but also can achievedistributed integrated scheduling in three workshops with different equipmentresources better, at the same time, it reduces the product finishing timeeffectively.