基于Project 2003的关键链启发式算法  

A Heuristic Algorithm of Critical Chain Based on Project 2003

作　　者：崔南方[1] 刘娟[1] 

机构地区：[1]华中科技大学管理学院,湖北武汉430074

出　　处：《工业工程与管理》2009年第3期60-64,共5页Industrial Engineering and Management

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

摘　　要：介绍了关键链项目管理的基本方法;针对资源受限项目调度问题,提出了资源冲突时的资源分配原则;以项目工期最小化为目标,以Project 2003为辅助工具,提出了一个确定关键链的启发式算法,即在找出关键路径的基础上,从后往前遍历,对发生资源冲突的活动,依资源分配原则修改紧前关系,然后再确定关键链,进而得到了基于关键链项目管理方法的项目调度算法。对算法进行了验证,结果表明算法是有效的。Critical Chain Project Management（CCPM）methods are introduced. The principles of assigning the conflict resources are proposed for resource-constrained project scheduling problems. Then,a critical chain heuristic algorithm based on the Project 2003 software is proposed to obtain an approximate optimal project schedule with a minimum makespan. The critical chain can easily be found through modifying the precursor relationship in accordance with the principles of assigning the conflict resources on the basis of finding critical path. The algorithm for project scheduling is provided with CCPM methods. Finally, a computational example is given and the result showed that the algorithm is effective.

关 键 词：关键链项目管理 资源冲突 紧前关系 

分 类 号：F406[经济管理—产业经济]