摘要
邻接矩阵求幂法和可达矩阵法是当前常用的项目耦合活动集求解算法,但是采用这两种算法求解出的耦合活动集中可能隐含更小的耦合活动集,对此在邻接矩阵求幂法的基础上,对求出的耦合活动集进行真实性判断及后续处理,找出了耦合活动集中存在的子耦合活动集,获得了更为精确的耦合活动集。
The powers of the adjacency matrix method and the reachability matrix method are the main algorithms for the solution of coupled activity set of project, but smaller sets of coupled activities may exist in the coupled activity sets resolved by these two algorithms.On the basis of the powers of the adjacency matrix method, the uniqueness of the sets of coupled activities is checked, and follow-up treatment is adopted to identify subsets of coupled activities.More accurate sets of coupled activities are obtained.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第17期34-36,共3页
Computer Engineering and Applications
基金
国家高技术研究发展计划(863)(No.2008AA04Z113)
上海市科委基础研究重点项目(No.08JC1419400)
上海市科委"十一五"科技攻关项目(No.09DZ1120800)~~
关键词
耦合活动集
结构设计矩阵
邻接矩阵
项目管理
coupled activity set
design structure matrix
adjacency matrix
project management