摘要
本文首先剖析了双代号箭线网络图的虚工序与紧前工序集合的关系，提出了紧前工序集合的相关子集族的概念，并在此基础上提出了确定最少虚工序的定理及其证明，从而为完全自动地绘制最优双代号箭线网络图创造了条件。
This paper has a nalyzcd the relatio nship between dummy works and prior一in-close work sets of a dual一code一network一diagram,put forward a new concept called correlative sub一cluster of prior一in一close work Sets.On the basis of this concept,a theorem determining minimum dummy works and its proof have been drawn up.So it created a condition for drawing the optimal network diagram fully automatically
出处
《系统工程学报》
CSCD
1995年第1期71-80,共10页
Journal of Systems Engineering
关键词
网络图
工序网络
虚工序
最少虚工序
activity network,a dummy,dummies,corrcidtive activity set,coelements set cluster,a theorem of detcrmining least dummies
