基于带标记的并发可达标识图的关键路径的求解方法-计算机科学.PDF

第 43 卷第11 期 计算机科学 Vo 1. 43 No. 11 2016 年 11 月 Computer Science Nov 2016 基于带标记的并发可达标识图的关键路径的求解方法 韩耀军 (上海外国语大学国际工商管理学院信息管理系 上海 200083) 摘 要 将 AOE 网转换成有色时延Petri 网模型，在模型转换过程中同时计算出各位置所对应的事件的最早开始时 间，给出了模拟 AOE 网的有色时延Petri 网模型的带标记的并发可达标识图的构建算法;利用并发可达标识图中的 标记序列直接得到关键路径并计算出完成所有活动所需的最短时间。实例与仿真实验结果表明，当 AOE 网中平均 存在 3 个以上的并发活动时，所提方法执行效率优于传统的求解关键路径的算法，并发活动越多，所提算法效率越高。 关键词 有色时延Petri 网，并发可达标识图，AOE 网，关键路径 中固法分类号 TP301 文献标识码 A DOI 10. 11896/j. issn. 1002-137)♀ 2016. 11. 023 Method for Finding Critical Paths ßased on Concurrent Reachable Marking Graph with Tags HAN Yao-jun (Department of Information Management. School of Business and Management. Shanghai International Studies University. Shanghai 200083. China) Abstract The color timed Petri net model was gotten by transforming AOE network in this paper. The earliest event start time was calculated while constructing Petri net model. The algorithm of constructing concurrent reachable ma r- king graph with tags for color timed Petri net modeling AOE network was given. The critical paths were gotten and the shortest time of completing all activities was calculated from tags of concurrent reachable marking graph. The example and simulation show that the execution efficiency of the algorithm is better than traditional algorithm for finding critical paths when there are more than three concurrent activities in AOE network. The more the concurrent activities are ,the higher the efficiency is. Ke归10时s Color timed Petri net ,Concurrent reachable marking graph ,AOE network ,Critical paths 延Petri 网计算出各库所对应工序的最早和最晚开工时间，进 引言