考虑后续工序且批处理工序数为2的批综合调度算法

Batch Integrated Scheduling Algorithm Considering Posterior Operations and with Constraint of 2 Operations Batches Processing

提出了考虑后续工序且批处理工序数为2的批综合调度算法.该算法根据复杂产品具有树状工艺结构的特点,对非批处理设备上的工序采用已有的优先级、调度长路径和长用时策略调度;对批处理设备上的工序,综合考虑先行工序和后续工序的加工时间对批处理的影响,当被等待工序非批处理延迟时间大于批处理时批处理工序的后续工序加工时间之差时,等待工序与被等待工序一同批处理.通过采用批处理判断策略、提前最大化策略以及并行最大化策略使批处理调度结果更合理.理论分析和实例证明,该算法可使批处理工序数为2的批综合调度结果更优,而且复杂度不超过二次多项式.

A batch integrated scheduling algorithm considering posterior operations and with constraint of 2 operations batches processing was proposed. On the base of tree structure features of complex products, this algorithm uses priority strategy, long-path strategy and long-time strategy to scheduling operations on non-batch processing machines. For operations processed on batch processing machines, the influences on batch processing by the process time of predecessor operations and posterior operations are taken into full consideration. When the deferred-time in the case of non-batched-processing is longer than the processing lag of posterior operations when operations are batch processed, the waiting operations and operations-wai- ted are batch processed simultaneously. Otherwise, they are not batch processed. The through scheduling using batch judgment strategy, early processing maximization strategy and parallel maximization strategy, the scheduling result is more reasonable. The theoretical analysis and examples show that the proposed al-gorithm can make the process result of batch integrated scheduling with constraint of 2 operations much better, and the time complexity is no more than quadratic polynomial.