运用总时差求CPM网络中次关键路线的方法研究  

A Method of Finding the Secondary Critical Path by Total Floats in CPM Network

作　　者：张立辉[1] 乞建勋[1] 

机构地区：[1]华北电力大学工商管理学院,北京102206

出　　处：《运筹与管理》2008年第4期79-83,88,共6页Operations Research and Management Science

基　　金：国家自然科学基金资助项目(70671040);教育部博士点基金资助项目(20050079008)

摘　　要：次关键路线在项目进度控制和工期压缩问题中具有重要意义。本文在给出CPM网络计划的一些新概念的基础上,提出了前主链定理、后主链定理和总时差定理,并且找到了一种运用总时差快速求解网络次关键路线的方法。文章对该方法进行了正确性证明,并给出了应用实例。The second critical path plays a very important role in the project scheduling and optimal compression of the project in time-cost trade-off problems. Based on some new concepts, the preceding main chain theorem , the succeeding main chain theorem and the total float theorem are offered, and then a method is given to find the second critical path in a CPM network quickly by total floats. Finally this method is proved to be correct, and a sample shows that it is very simple and convenient.

关 键 词：运筹学 次关键路线 总时差 CPM网络 

分 类 号：F224.33[经济管理—国民经济]