An algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device

Abstract Aiming at the defect that quasi critical path algorithm can't take into account both vertical scheduling and horizontal scheduling when scheduling products, this paper proposes an algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device. The algorithm takes the scheduling scheme formed by the quasi critical path strategy as the basic scheduling scheme, proposes and applies the adjacent parallel processes interchange strategy and the adjacent parallel processes adjustment strategy, generates several new product scheduling schemes, and adds them to the product scheduling scheme set. Finally, according to the optimal product scheduling scheme selection strategy, the product scheduling scheme with the minimum total processing time is selected as the final scheduling scheme. The proposed algorithm ensures the compactness of the serial processes, improves the parallel processing of the parallel processes, and optimizes the scheduling results.