Scheduling Algorithm for Two-Workshop Production with the Time-Selective Strategy and Backtracking Strategy

Abstract

To solve the two-workshop integrated scheduling problem with the same device resources, existing algorithms pay attention to the horizontal parallel processing of the process tree and ignore the tightness between vertical serial processes. A scheduling algorithm for two-workshop production with the time-selective strategy and Backtracking Strategy is proposed. The scheduling order of each process in the process tree needs to be determined, which will be completed by the process sequence sequencing strategy. The scheduling plan also needs to be determined, which will be completed using the time-selective scheduling strategy for the two workshops. At the same time, the “reference time” is set for the current scheduling process. To find a better scheduling scheme, the “scheduling reference time” is recorded as T. If the time of the current scheduling process scheme is greater than T, the backtracking adjustment strategy will be used to track the process scheduling scheme. Finally, experiments show that the algorithm not only ensures the parallel processing of parallel processes but also effectively improves the tightness of serial processes and optimizes the results of integrated scheduling.