Abstract: 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waited 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 algorithm 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.  

Key words: scheduling algorithm, integrated scheduling, batching integrated scheduling, batch processing machine, posterior operation