摘要
在研究最短通路问题的基础上,通过"最短通路"与"关键路径"的对比研究,给出PERT/CPM问题(计划评审技术图/关键路径方法的简称)相应的"对偶"的矩阵定义及"对偶"运算法则,进而推出"对偶"的计算公式.
Based on the study of shortest path problem,through the comparative study of ＂shortest path＂ and ＂critical path＂ and its duality,matrix definition of the corresponding PERT/CPM diagram and its algorithm were given,and then the formula of the critical path in PERT/CPM was derived.
出处
《湖北大学学报（自然科学版）》
CAS
2014年第6期530-533,542,共5页
Journal of Hubei University：Natural Science
关键词
图论的应用
PERT/CPM
关键路径
赋权图邻接矩阵
矩阵计算公式
application of graph theory
PERT/CPM
critical path
a weighted diagram of adjacent matrix
the calculation formula of matrix
