[1] Goldratt E M. Critical Chain[M]. New York: The North River Press, 1997. [2] Mendes J J M, Gonalves J F, Resende M G C. A random key based genetic algorithm for the resource constrained project scheduling problem[J]. Computers & Operations Research, 2009, 36(1): 92-109. [3] Bouleimen K, Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version[J]. European Journal of Operational Research, 2003, 149(2): 268-281. [4] 田文迪,崔南方.关键链项目管理中关键链和非关键链的识别[J].工业工程与管理,2009,14(2):88-93. [5] 程序,吴澄.一种复杂项目调度问题的混合智能算法[J].计算机集成制造系统,2006,12(4):585-589. [6] Newbold R C. Project management in the fast lane——applying the theory of constraints[M]. The St.Lucie Press, Boca Raton, 1998. [7] Tukel O I, Rom W O, Eksioglu S D. An investigation of buffer sizing techniques in critical chain scheduling[J]. European Journal of Operational Research, 2006, 172(2): 401-416. [8] 别黎,崔南方.关键链多项目管理中能力约束缓冲大小研究[J].计算机集成制造系统,2011,17(7):1534-1540. [9] Herroelen W, Leus R. On the merits and pitfalls of critical chain scheduling[J]. Journal of Operations Management, 2001, 19(5): 559-577. [10] 彭武良,王成恩.关键链项目调度模型及遗传算法求解[J].系统工程学报,2010,25(1):123-131. [11] Cui N, Tian W, Bie L. Rescheduling after inserting the buffer in the critical chain scheduling[C]//Logistics Systems and Intelligent Management, 2010 International Conference on. IEEE, 2010, 2: 1105-1110. [12] Herroelen W. Project and production scheduling[M]. Leuven: Acco, 2007. [13] Leus R. The generation of stable project plans[D]. Department of applied economics, KatholiekeUniversiteit Leuven, Belgium, 2003. [14] Van de Vonder S, Demeulemeester E, Herroelen W. Proactive heuristic procedures for robust project scheduling: an experimental analysis[J]. European Journal of Operational Research, 2008, 189(3): 723-733. [15] Van de Vonder S, Demeulemeester E, Herroelen W, et al. The use of buffers in project management: the trade-off between stability and makespan[J]. International Journal of Production Economics, 2005, 97(2): 227-240. |