Dynamic Integrated Scheduling Algorithm of Complex Multi-Products with Identical Machines
Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an algorithm is presented by this paper that complex multi-products can be built a virtual manufacturing tree. And the tree will be divided into many subtrees according to the subsection idea. Then these subtrees will be divided into dependent operations and independent operations. Corresponding scheduling strategy is put forward according to the features of operations and the complementarities of identical machines. For dependent operations, forward greedy rule is mainly adopted. For the independent operations, this paper mainly adopts the optimum scheduling rule. Example shows that favorable results can be obtained according to scheduling strategy adopted by this paper.
Xie Yi and Li Mi
Z. Q. Xie et al., "Dynamic Integrated Scheduling Algorithm of Complex Multi-Products with Identical Machines", Advanced Materials Research, Vols. 129-131, pp. 897-901, 2010