考虑后续工序的择时综合调度算法

针对目前综合调度算法不能兼顾产品工艺树中并行工序的并行性和串行工序之间紧密度，影响调度结果的问题，提出考虑后续工序的择时综合调度算法.该算法提出工序序列排序策略，从工艺树的整体结构出发，将其划分成若干内部工序只具有串行关系的工序序列，并按路径长度从长到短的顺序确定其调度次序；提出择时调度策略和考虑后续工序策略，根据工艺树自身特点，从来自不同工序序列的并行工序的不同组合方案中，选择最接近调度目标的方案作为工序调度方案，若该工序调度方案不唯一，则在其中选择该工序加工开始时间最早的调度方案.该算法既保证了工序的并行处理，又提高了串行工序的紧密度，优化了综合调度的结果.最后通过实例说明本文算法对解决综合调试问题具有普遍意义.

Time-selective Integrated Scheduling Algorithm Considering Posterior Processes

Integrated scheduling algorithms currently neglected the compactness of serial processes when handling a general integrated scheduling problem, and it influenced the scheduling result. Aiming at this problem, an time-selective integrated scheduling algorithm considering posterior processes was presented. The strategy of process sequence sorting was proposed. From the overall structure of the process tree, it was divided into several sequence of processes in which the processes only had a serial relationship. According to the path length to determined the order of its scheduling. The strategy of time-selective and considering posterior processes was proposed. According to the characteristics of the process tree, selected the most close to the scheduling objectives as a process scheduling scheme from the different combination of parallel process from different process sequence. If the process scheduling scheme was not unique. selected the process scheduling scheme in which The processing start time of the process was the earliest. This algorithm promises to proceed together the parallel processing of processes, and effectively raises the compactness of serial processes. The results of integrated scheduling are optimized. Finally illustrated by examples.