摘要
本文论述了设计工程进度计划网络图自动生成器的一个关键性工作,即如何让计算机自动将网络各项活动的紧前紧后关系转换成以邻接矩阵或节点对形式表示的网络。文中针对网络活动逻辑关系的计算机表示、网络活动逻辑关系的数字化处理、初步形成网络的简化等作了较为详细的讨论。
This Paper deals with the key to the auto-generator design of network graphs, this is, how to translate the predecessor and successor relationships of network activities in language into network represented by adjacency-matrix or nodes-couples with microcomputer. Here, we discuss how to express and translator the logical relations of network activities. The final network is represented by adjacencymatrix or nodes-couples.
出处
《管理工程学报》
CSSCI
1989年第1期82-88,共7页
Journal of Industrial Engineering and Engineering Management
基金
中国科学院科学基金