检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统工程理论与实践》2010年第2期356-360,共5页Systems Engineering-Theory & Practice
基 金:国家自然科学基金(70671040);教育部博士点基金(20050079008)
摘 要:研究CPM网络中单个工序工期的变化对网络关键路线即总工期的影响.首先提出主路线等概念和总时差定理,揭示出关键路线与工序总时差的关系;然后提出了最小时差非特征工序等概念和替代最长路线定理,研究了不经过某工序的最长路线与该工序之间的关系.最后以这两个定理为基础,分别分析了非关键工序和关键工序工期对总工期的敏感性问题,计算复杂性为O(m),其中m代表CPM网络中工序的数目.This paper addresses sensitivity analysis for changes of an activity duration to the project duration in CPM network. First it presented the theorem of total float to disclose the relationship between the critical path and the total float of an activity, and then proposed the theorem of the longest substituting path to disclose the relationship between an activity and the longest path without passing through it. On the basis of these two theorems, the sensitivity analysis of both critical activity and non-critical activity changes to project duration was made. The complexity of the algorithm is O(m), where m denotes the number of the activities in the CPM network.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15