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

通过举例说明在关键链项目计划中插入输入缓冲后，可能出现资源冲突和紧前关系冲突。从局部和全局两个方面采用分支定界法对项目计划进行重排来解决冲突问题。通过举例说明基于分支定界法的计划重排算法是有效和可行的。通过模拟仿真，从三个不同层次分析项目活动任务的不确定性对项目完工率和项目惩罚成本的影响。结果显示，保留原始关键链的基于分支定界法的全局性关键链计划重排方法较之其他方法要好，不确定性更低，项目的完工率更高，项目的惩罚成本更低。

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

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.