A Dynamic Scheduling Algorithm for Complex Product with Batching Machines

At present, scheduling research with batching machines mainly solves scheduling problem without constraint among operations. There is no effective scheduling method for complex product with batching machines. To that end, a new algorithm is proposed to solve dynamic scheduling problem for complex product with batching machines. And the maximum lot-size of the batching machines is two. First, based on the feature of the structure of the processing tree which is provided with complex product, the algorithm adopts Priority strategy, Short-time strategy and Long-path strategy to schedule operations. Second, when the operations belong to batching machine, the algorithm adopts Long-path strategy, Critical-time waiting strategy and Short-time of precursor strategy to schedule operations. Theoretical analysis and examples show that the algorithm can solve dynamic scheduling problem for complex product with batching machines and the maximum lot-size of the batching machines is two. In addition, the complexity is not more than quadratic polynomial.