Dynamic Integrated Scheduling Algorithm of Complex Multi-Products with Identical Machines


Article Preview

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.



Advanced Materials Research (Volumes 129-131)

Edited by:

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

Online since:

August 2010




[1] S. Rajakumar, V.P. Arunachalam, V. Selladurai. Workflow balancing strategies in parallel machine scheduling. The International Journal of Advanced Manufacturing Technology, 2004, 23: 366-374.

DOI: https://doi.org/10.1007/s00170-003-1603-4

[2] Z.Q. Xie, S.H. Liu, P.L. Qiao. Dynamic Job-Shop Scheduling Algorithm Based on ACPM and BFSM. Journal of Computer Research and Development, 2003, 40(7): 977-983.

[3] S.J. Wang, B.H. Zhou, L.F. Xi, S.W. Fu. A Filter-Based Beam Search Algorithm for Job Shop Scheduling. Mechanical Science and Technology, 2005, 24(1): 22-25.

[4] Z.Q. Xie, G.J. Ye, D.L. Zhang, G.Y. Tan. New Nonstandard Job Shop Scheduling Algorithm. Chinese Journal Of Mechanical Engineering, 2008, 21(4): 97-100).

DOI: https://doi.org/10.3901/cjme.2008.04.097

[5] D. Bertsimas, J. Sethuraman. From Fluid Relaxations to Practical Algorithms for Job Shop Scheduling: the Makespan Objective. Math. Program, Ser. A, 2002, 92: 61-65.

DOI: https://doi.org/10.1007/s101070100272