基于分支定界法的关键链项目计划重排  

Rescheduling based on branch-and-bound in critical chain project scheduling

作　　者：田文迪[1] 崔南方[2] 付樟华[3] 

机构地区：[1]武汉纺织大学管理学院,武汉430073 [2]华中科技大学管理学院,武汉430074 [3]华中科技大学计算机科学与技术学院,武汉430074

出　　处：《计算机应用研究》2011年第11期4035-4039,4048,共6页Application Research of Computers

基　　金：国家自然科学基金资助项目(61070235)

摘　　要：通过举例说明在关键链项目计划中插入输入缓冲后,可能出现资源冲突和紧前关系冲突。从局部和全局两个方面采用分支定界法对项目计划进行重排来解决冲突问题。通过举例说明基于分支定界法的计划重排算法是有效和可行的。通过模拟仿真,从三个不同层次分析项目活动任务的不确定性对项目完工率和项目惩罚成本的影响。结果显示,保留原始关键链的基于分支定界法的全局性关键链计划重排方法较之其他方法要好,不确定性更低,项目的完工率更高,项目的惩罚成本更低。There are some resource conflicts and precedence conflicts that might be happened after inserting feeding buffer in the critical chain scheduling/buffer management.These conflicts could be solved by using the branch-and-bound rescheduling algorithms which included both global and local rescheduling.Finally,it designed some simulations to evaluate the impact of three different levels of activity uncertainty on the project completion rate and stability cost.The computational results indicate that the critical chain rescheduling based on global branch and bound which keeps the original critical chain is the best among all.Besides,the lower the uncertainty,the higher the timely completion probability and the lower the stability cost.

关 键 词：关键链项目管理 分支定界法 项目计划重排 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]