Integrated Scheduling Algorithm With Batch Processing Machines With the Lot-size Being Two

A new algorithm is proposed to solve the integrated scheduling problem of single complex product with batch processing machines.The maximum lot-size that the batch processing machines can process is two.According to the feature of the structure of the processing tree that is provided with complex products,the algorithm first adopts the priority strategy,short-time strategy and long-path strategy to schedule operations.When the operations belong to the batching machine,the algorithm then adopts the long-path strategy,critical-time waiting strategy,and short-time of previous operation strategy to schedule operations.Theoretical analysis and examples show that the algorithm can solve the integrated scheduling problem of single complex products with batch processing machines on which the lot-size of operations being processed is two.In addition,the complexity is not more than quadratic polynomial.