摘要
研究了将原始的施工工序关系分解表转换为网络图的节点关系的算法。在说明了网络计划图的规则和对构造网络图的一个较为经典的“无图直接编号算法”描述后，分析了其算法结果的不足。从理论上探讨了网络图中活动的紧前活动与节点的关系，提出了一个“网络计划图的按类生成算法”。
This paper studies the algorithm that original relations among jobs of a project are transformed into node relations in a PERT network.The rule of PERT network is explained.An algorithm of right number in no graph is stated,and its shortcomings are analyzed.This paper discusses mutuality of pre jobs and nodes and presents the algorithm based on pre jobs classification in PERT network.
基金
建设工业部有偿资助项目
