摘要
在网络计划技术的实际应用过程中,不仅要关心关键路线,同时也要兼顾其它一些可行路线,尤其是次关键路线。本文对传统的CPM和PERT方法加以改进,提出了,同时确定关键路线和次关键路线的一种简单算法,并且举例具体说明了计算过程,给出了若干关于网络互序和路线的一般性质。
In application of network technique, the critical paths, especially the next-critical path must be considered as well as other possible paths in the network. In this paper, CPM and PERT are modified to determine both the critical paths and the next-critical paths, and an example is presented to demonstrate the algorithm. In the mean time, several characters of avtivities and paths are presented.
出处
《系统工程理论方法应用》
1993年第4期49-53,共5页
Systems Engineering Theory·Methodology·Applications
关键词
关键路线
次关键路线
算法
Critical path, Next-critical paths, Critical activity, Next-critical activity, Path length, Algorithm
