基于EVM矩阵求解关键路径的方法  

A Method for Finding Critical Path Based on EVM Matrix

作　　者：林铭德[1] 戴一璟[2] 

机构地区：[1]福建工程学院计算机与信息科学系,福建福州350108 [2]福建工程学院管理学院,福建福州350108

出　　处：《武汉理工大学学报（信息与管理工程版）》2012年第6期690-694,共5页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：福建省科技厅重点基金资助项目(2009H0002);福建工程学院教研基金资助项目(TMC2010-5-23)

摘　　要：通过AOE(activity on edge)网络的邻接矩阵,构建一个算法求出EVM(earned value management)矩阵用于求解AOE网络中所有的工作路径以及关键路径。与传统算法相比,该算法实现简便,求解路径全面。考虑到AOE网络节点的增减、边权值的变化,该算法无需重新计算改变后的AOE邻接矩阵和生成新的EVM矩阵,只需对原有的EVM矩阵进行部分改变即可用较小的计算开销得到正确的结果。Through the AOE network adjacency matrix,an algorithm was constructed to derive the EVM matrix so as to solve the AOE network in all the working paths and all of the critical paths.Compared with the traditional method,it can be simply realized,and it can solve out all paths.The algorithm does not need to recalculate the AOE adjacency matrix and generate a new EVM matrix after the change of AOE network node or edge weight.The correct results could be achieved by a little computing cost while the original EVM matrix was partly changed.

关 键 词：AOE网 邻接矩阵 关键路径 EVM矩阵 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]