A Two-Workshop Collaborative, Integrated Scheduling Algorithm considering the Prescheduling of the Root-Subtree Processes

Abstract

Aiming at the existing two-workshop integrated scheduling algorithm with the same equipment resources, a unified vertical or horizontal scheduling rule is used to sort all processes and ignore the vertical and horizontal characteristics of the associated process position in the process tree, which affects the scheduling results. A two-workshop collaborative, integrated scheduling algorithm considering the prescheduling of the Root-Subtree processes is proposed. The algorithm proposes a process conflict adjustment strategy for the horizontal equipment constraints. The same equipment Root-Subtree processes are sorted and loaded into the corresponding equipment queue through the vertical and horizontal prescheduling method in a single-workshop environment, and it combines with the schedulable process set to dequeue the first process of the queue. To enhance the flexibility of process scheduling, it proposes a process conflict adjustment strategy for the vertical process tree constraints in the two workshops to determine the processing workshop of the processes and the actual start time, which narrows the search comparison for schedulable processes. The example tests show that the algorithm not only excavates and utilizes the effectiveness of the vertical and horizontal characteristics of the process tree, but also considers the process migration time. Therefore, the effect is better and more practical.