| 关键路径的矩阵计算公式 |
| |
| 引用本文： | 朱志雄. 关键路径的矩阵计算公式[J]. 湖北大学学报(自然科学版), 2014, 36(6): 530-533,542 |
| |
| 作者姓名： | 朱志雄 |
| |
| 作者单位： | 武汉软件工程职业学院人文学院,湖北武汉,430205 |
| |
| 摘 要： | 在研究最短通路问题的基础上,通过＂最短通路＂与＂关键路径＂的对比研究,给出PERT/CPM问题（计划评审技术图/关键路径方法的简称）相应的＂对偶＂的矩阵定义及＂对偶＂运算法则,进而推出＂对偶＂的计算公式.
|
| 关 键 词： | 图论的应用 PERT/CPM 关键路径 赋权图邻接矩阵 矩阵计算公式 |
Matrix operation of the critical path |
| |
| ZHU Zhixiong. Matrix operation of the critical path[J]. Journal of Hubei University(Natural Science Edition), 2014, 36(6): 530-533,542 |
| |
| Authors: | ZHU Zhixiong |
| |
| Affiliation: | ZHU Zhixiong;Department of Humanities,Wuhan Vocational College of Software & Engineering; |
| |
| Abstract: | 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. |
| |
| Keywords: | application of graph theory PERT/CPM critical path a weighted diagram of adjacent matrix the calculation formula of matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
