中文摘要：

针对传统关键链方法CCM忽略了调度方案的鲁棒性，提出基于鲁棒性目标的关键链项目调度优化问题．对插入输入缓冲导致的二次资源冲突，从鲁棒优化的角度提出一种启发式的协调策略，并设计基于两次调度过程和缓冲动态消耗的关键链鲁棒性度量指标．构建以鲁棒性最大化为目标的关键链项目调度优化模型CCPSP—R，并采用嵌入模型特征的启发式遗传算法求解．通过对较多随机算例的仿真测试，验证了CCPSP-R模型和求解方法的有效性．结果表明，CCPSP—R能较大程度地改善传统CCM的鲁棒性；对不同规模的项目网络测试算例，鲁棒性的平均改善度达到54．22％至210．4％．

英文摘要：

The schedule robustness is ignored in the traditional critical chain method （CCM）, so this paper presents the critical chain project scheduling problem with a robust objective （CCPSP-R）. Firstly, in the per- spective of a robust optimization, a specific heuristic strategy is developed to eliminate the second resource conflicts resulted from the insertion of feeding buffers. Then, combining two scheduling processes with dy- namic consumptions of buffers, a measure is designed to quantify the schedule robustness in the CCM. Second- ly, an optimization model with the objective of maximizing the robust for the CCPSP-R is established, and a heuristic genetic algorithm embedded the property of the model is constructed to solve it. Next, the model and its solution are verified by simulation experiments based on randomly generated data set. Finally, the results show the optimal schedule from the CCPSP-R can greatly improve the robustness of the schedule from the traditional CCM, and the average improvement of the robust index amounts to 54.22%-210.4% for all tested instances with different project sizes.