An Algorithm for Complex Product Dynamic Integrated Flexible Scheduling

Aiming at the dynamic scheduling problem with many products, a virtual processing operation tree is constructed by products with different arriving times. The multi-product dynamic flexible scheduling problem is converted into the virtual single-product flexible scheduling problem. A new hierarchical scheduling algorithm for solving dynamic flexible scheduling problem with constraint between jobs is present in this study. Aiming at the routing problem, short-time strategy and machine-balance strategy are adopted to assign each operation to a machine out of a set of capable machines. And in order to solve the sequencing problem, operations are divided into the dependent operations and the independent ones. To the dependent operations, forward greedy rule is adopted in order to make the completion time of operation as early as possible and the scheduling algorithm of shorten idle time is adopted by analyzing the characteristics of the independent operations. Experiment shows that the proposed algorithm can solve firstly the complex product dynamic flexible scheduling problem with constraints between jobs.