检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《工业工程与管理》2009年第2期88-93,共6页Industrial Engineering and Management
摘 要:运用动态规划的思想设计了一个启发式算法来识别关键链和非关键链。采用此算法对标准问题库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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28