| 基于带标记的并发可达标识图的关键路径的求解方法 |
| |
| 引用本文： | 韩耀军.基于带标记的并发可达标识图的关键路径的求解方法[J].计算机科学,2016,43(11):121-125, 141. |
| |
| 作者姓名： | 韩耀军 |
| |
| 作者单位： | 上海外国语大学国际工商管理学院信息管理系 上海200083 |
| |
| 基金项目： | 本文受上海市哲学社会科学规划一般课题(2010BTQ001),上海外国语大学校级重大科研项目(2013114ZD004),上海外国语大学国际工商管理学院高层次培育项目资助 |
| |
| 摘 要： | 将AOE 网转换成有色时延Petri网模型,在模型转换过程中同时计算出各位置所对应的事件的最早开始时间,给出了模拟AOE 网的有色时延Petri网模型的带标记的并发可达标识图的构建算法；利用并发可达标识图中的标记序列直接得到关键路径并计算出完成所有活动所需的最短时间。实例与仿真实验结果表明,当AOE网中平均存在3个以上的并发活动时,所提方法执行效率优于传统的求解关键路径的算法,并发活动越多,所提算法效率越高。
|
| 关 键 词： | 有色时延Petri网 并发可达标识图 AOE网 关键路径 |
| 收稿时间： | 2015/7/26 0:00:00 |
| 修稿时间： | 2016/1/18 0:00:00 |
Method for Finding Critical Paths Based on Concurrent Reachable Marking Graph with Tags |
| |
| HAN Yao-jun.Method for Finding Critical Paths Based on Concurrent Reachable Marking Graph with Tags[J].Computer Science,2016,43(11):121-125, 141. |
| |
| Authors: | HAN Yao-jun |
| |
| Affiliation: | 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 mar-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. |
| |
| Keywords: | Color timed Petri net Concurrent reachable marking graph AOE network Critical paths |
|
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
