An Improved Integrated Scheduling Algorithm with Process Sequence Time‐Selective Strategy

Abstract

The integrated scheduling algorithm of process sequence time-selective strategy (ISAOPSTSS) is an advanced algorithm in the field of integrated scheduling. The proposed algorithm points out the shortcomings of the process sequence time-selective strategy. Generally, there are too many “trial scheduling” times. The authors propose that there is no need to make “trial scheduling” at every “quasi-scheduling time point.” In fact, the process scheduling scheme can be obtained by trial scheduling on some “quasi-scheduling time points.” The scheduling result is the same as that of the sequence timing strategy. The proposed algorithm reduces the runtime of scheduling algorithm and improves the performance of the algorithm without reducing the optimization effect.

A Reverse Order Hierarchical Integrated Scheduling Algorithm Considering Dynamic Time Urgency Degree of the Process Sequences

“…Without losing generality, 100 product PTs were randomly generated. The following parameters were randomly generated: the number of processes is [20,50], the number of immediate predecessor processes of each non-leaf node is [1,10], the number of machining equipment is [3,10], and the machining time of a process is [1,20]. The software used on the experimental platform was Windows 7, 64-bit, GCC5.0, and the hardware of the experimental platform was an Intel Core i5-3470S processor with 4 GB of memory.…”

“…The research has gone through a process from focusing on the path length (vertical) of the product process tree affecting the scheduling results to focusing on the SLP (horizontal) of the product process tree affecting the parallel scheduling results. Representative algorithms include the dynamic critical path method [17], time-selective adjustment method [18][19][20], and reverse order scheduling method [21], etc.…”