Research On Scheduling For Complex Product With Batch Processing Machines

With the community's demand for more variety, low-volume product increasing, scheduling for complex products get more and more attention. There are some research results for scheduling problem of complex products. But there is no effective scheduling method of single complex product with batch processing machines. So the research on scheduling for complex product with batch processing machines has important value both in practice and theory.Because batch processing machines are not considered, based on the analysis for the current existence, a new algorithm is proposed to solve scheduling problem of complex product with batch processing machines. And the maximum lot-size of the batch processing machines is two.In order to take full advantage of the features of batch processing machines that can process two operations at the same time, and not waste time for waiting for other non-arrival operations, when the operations belong to batching machine, the algorithm adopts Critical-time waiting strategy, Long-path strategy and Short-time of previous operation strategy to schedule operations. Achieve scheduling problem of complex product with batch processing machines and the lot-size of the batch processing machines is two.As far as scheduling problem of complex multi-product with batch processing machines, every product is considered as a sub-tree of processing tree, a virtual processing tree is generated. Then using the scheduling algorithm of single-product, the virtual processing tree is scheduled.A method of constructing virtual processing tree for dynamic scheduling problem is proposed to simplify these kinds of problems. Finally, the complete algorithm is given. To solve the above three kinds of situation,the proposed algorithm is verified.