摘要
为进一步优化网络图虚工序自动识别算法,提高计算机自动绘制网络图虚工序的效率,在分析虚工序的添加原理和以往的虚工序自动识别算法存在的问题的基础上,针对2种不同类型的虚工序,采用分类识别、增加判断条件的方法对该算法进行了改进,并举例对算法效果进行了验证。通过对改进后的算法与以往算法的效果进行对比可以证实:改进后的算法不仅在内容上更为具体,而且有效地减少了网络图中重复、多余的虚工序,进一步优化了网络图的结构。
To optimize the automatic identification algorithm of dummy activities in network charts and enhance the efficiency of automatic drawing of network charts, improvements were made by analyzing problems existing in previous algorithms using sorting identification methods and adding judging conditions. According to two different types of dummy activities, an example was given to verify the effect of the new algorithm. By comparing the effect of the improved algorithm with that of previous ones, result is got that the improved algorithm is not only more concrete in content, but also effectively reduces repetitious and redundant dummy activities and optimize the structure of the network chart.
出处
《解放军理工大学学报（自然科学版）》
EI
北大核心
2009年第B12期16-20,共5页
Journal of PLA University of Science and Technology(Natural Science Edition)
关键词
网络计划技术
双代号网络图
虚工序
自动识别
network plan technique
activity-on-arrow network chart
dummy activity
automatic identification
