摘要
运用动态规划的思想设计了一个启发式算法来识别关键链和非关键链。采用此算法对标准问题库PSPLIB中的问题J301_1.SM进行实例求解,识别出来的两条关键链的长度比文献[11,14]中算法求得的长度缩短了6个单位时间。
Identifying the critical chain, is not only the first step, but also the most important step amongng five focus steps in the critical chain project management,. Through the dynamic programming, a new heuristic algorithm to identify the critical chain and non-critical chain was introduced in this paper. The instance J301_ 1. SM from the well-known standard instances PSPLIB was resolved by this new heuristic aAlgorithm. Compared with the results in the literature review[11, 14], the lengths of two identified critical chains were proved to be 6 unit time short.
出处
《工业工程与管理》
北大核心
2009年第2期88-93,共6页
Industrial Engineering and Management
关键词
关键链
关键链项目管理
关键链识别
约束理论
critical chain
critical chain project management
Identifying the Critical Chain
TOC