Abstract: Aiming at the problem of ignoring the compactness of serial processes when being compatible with parallel processing of processes that leads to the imprecision result,an time-selective integrated scheduling algorithm considering the compactness of serial processes is presented.The strategy of process sequence sorting is proposed, and it divide the processes into several process sequences based on the integral structure of the processing tree, and the processes in these sequences only has serial relation.Determine the scheduling order according to the length of the process sequence; the time-selective strategy is proposed, and some legal processing time points are selected for the scheduling process according to the characteristics of the process tree. trial scheduling process at each time point respectively,a set of trial scheduling scheme for the process is obtained, The scheme which's total scheduling time is least in the set is chosen as the process scheduling scheme. If not unique, the scheme in which the start time of the process is earliest should be selected. Example shows that the proposed algorithm can raise the compactness of serial processes when being compatible with parallel processing of processes, and make the scheduling result more accurate.

Key words: compactness, integrated scheduling algorithm, process sequence sorting, serial process, time-selective