Task-Oriented Hierarchical Planning and Scheduling for Discrete Manufacturing Enterprise


Article Preview

Considering the complexity and uncertainty of production planning in large manufacturing enterprise, hierarchical planning and scheduling is an effective solution to overcome the difficulty of scheduling both in long term and short term. Choosing a discrete task-oriented manufacturing factory as prototype, a hierarchical planning and scheduling model is developed, which consists of key resource leveling, detailed operation scheduling and workshop control. The upper level optimizes the bottleneck resource allocation based on aggregate networks of product, to make a feasible long term plan; short term schedule is then generated in medium level, using more detailed network; the schedule is finally executed in bottom level, which introduces a re-scheduling strategy to eliminate the plan error. To solve the model, the universal aggregate task network model and the algorithm for each level are researched. The simulation result demonstrated that the hierarchical method is valid and valuable in practice.



Edited by:

Kai Cheng, Yingxue Yao and Liang Zhou




G. L. Wang et al., "Task-Oriented Hierarchical Planning and Scheduling for Discrete Manufacturing Enterprise", Applied Mechanics and Materials, Vols. 10-12, pp. 114-120, 2008

Online since:

December 2007




[1] Goldrat EM: The theory of constraints (North River Press, Inc. 1986, in press).

[2] Y.H. Lee, C.S. Jeong and et al: Computers & Industrial Engineering, Vol. 43 (2002), pp.351-374.

[3] K.J. Chen, P. Ji: A mixed integer programming model for advanced planning and scheduling (APS) (European Journal of Operational Research, 2006).

[4] B.P. Das, J.G. Rickard and et al: Computers and Chemical Engineering, Vol. 24 (2000), pp.1625-1631.

[5] Felipe D. Vargas-Villamil and et al: Computers and Chemical Engineering, Vol. 24 (2000), p.2009-(2021).

[6] Kenneth N. Mckay, Vincent C.S. Wiers: Computers in Industry, Vol. 50 (2003), pp.5-14.