An Integrated Scheduling Algorithm for the Same Equipment Process Sequencing Based on the Root-Subtree Vertical and Horizontal Pre-Scheduling

Abstract

Given the existing integrated scheduling algorithms, all processes are ordered and scheduled overall, and these algorithms ignore the influence of the vertical and horizontal characteristics of the product process tree on the product scheduling effect. This paper presents an integrated scheduling algorithm for the same equipment process sequencing based on the Root-Subtree horizontal and vertical pre-scheduling to solve the above problem. Firstly, the tree decomposition method is used to extract the root node to split the process tree into several Root-Subtrees, and the Root-Subtree priority is set from large to small through the optimal completion time of vertical and horizontal pre-scheduling. All Root-Subtree processes on the same equipment are sorted into the stack according to the equipment process pre-start time, and the stack-top processes are combined with the schedulable process set to schedule and dispatch the stack. The start processing time of each process is determined according to the dynamic start processing time strategy of the equipment process, to complete the fusion operation of the Root-Subtree processes under the constraints of the vertical process tree and the horizontal equipment. Then, the root node is retrieved to form a substantial scheduling scheme, which realizes scheduling optimization by mining the vertical and horizontal characteristics of the process tree. Verification by examples shows that, compared with the traditional integrated scheduling algorithms that sort the scheduling processes as an overall, the integrated scheduling algorithm in this paper is better. The proposed algorithm enhances the process scheduling compactness, reduces the length of the idle time of the processing equipment, and optimizes the production scheduling target, which is of universal significance to solve the integrated scheduling problem. KEYWORDSHorizontal and vertical pre-scheduling; the priority of the Root-Subtree; the equipment process pre-start time; the dynamic start time strategy of the equipment process

A Heuristic Integrated Scheduling Algorithm via Processing Characteristics of Various Machines

“…Refs [34][35][36][37][38][39][40] are all studies on the integrated scheduling problem with machine as the research object. As the latest algorithm, the algorithm (RSVHPSA) in Ref [37] is selected to be compared and analyzed with the proposed algorithm. The experimental results also The scheduling sequence by HIS-PCVM on M 3 is {B19, B13, B11, B6, B9, B4}, and on the general machine, it is {B18, B15, B14, B12, B17, B8, B7, B16, B5, B3, B2, B10, B1}, as shown in Figure 13.…”

“…Refs [34][35][36][37][38][39][40] are all studies on the integrated scheduling problem with machine as the research object. As the latest algorithm, the algorithm (RSVHPSA) in Ref [37] is selected to be compared and analyzed with the proposed algorithm. The experimental results also show the superiority of HIS-PCVM.…”

“…Refs. [34][35][36][37][38][39][40] are all studies on the integrated scheduling problem with machine as the research object. As the latest algorithm, the algorithm (RSVHPSA) in Ref.…”

“…As the latest algorithm, the algorithm (RSVHPSA) in Ref. [37] is selected to be compared and analyzed with the proposed algorithm. The experimental results also show the superiority of HIS-PCVM.…”