摘要
针对AOE网进行活动流程合法性检查,讨论了项目管理中网络计划图的各个活动与其紧前活动间关系以及传统节点编号方法,提出了一种改进网络计划图回路检测算法。改进算法采用AOE网扩展邻接矩阵存储形式,通过辅助队列的应用,得到活动安排的有效序列,并使安排序列具备并行性特征,更加高效实用,有效降低了计算难度。
The logic detection of the process is important in the Activity on Edge（AOE） network.This paper discusses the relationships between the events and the pre-conference events in network,and the node coding algorithms how to get the node numbers.An improved new loop detection algorithm is proposed,using an extended adjacency matrix and applying an auxiliary queue.The new algorithm can create an effective sequence of events with distributed characters.Without adding virtual activities as well as the relationships among the individual pre-conference events,and no calculation of operatingt,he new al-gorithm is more efficient and less complex to get the result.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第35期222-224,227,共4页
Computer Engineering and Applications
基金
湖南省自然科学基金(No.07JJ6141)
湖南省教育厅科研项目(No.09C704)~~
关键词
网络计划图
AOE网
回路检测
紧前活动
network schedule graph
Activity on Edge networkl
oop detection
pre-conference events
