首页> 外文会议>Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on >Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition
【24h】

Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition

机译:基于改进的最短路径算法和叠加的工程工期评估模型

获取原文
获取原文并翻译 | 示例

摘要

This paper presents project duration assessment model based on modification of shortest path algorithms and superposition. One of the shortest path algorithms, Dijkstra algorithm, is modified in order to find the longest path. This is used for critical path calculation, i.e. for resolving project duration assessment problem. Another modification of algorithm calculates sub critical path as the second longest one. These paths are used for superposition, because of stochastic nature of many research and development projects which can cause that at some point in time sub critical becomes critical path. Thus, sub critical path influence on project duration should be taken into account, and, in this case, superposition is used for that. Superposition used in the model is based on analytical method -- Clark's formulas. Presented model can be used for business process improvement and project management support.
机译:本文提出了基于最短路径算法的改进和叠加的项目工期评估模型。修改了最短路径算法之一Dijkstra算法,以找到最长路径。这用于关键路径计算,即用于解决项目工期评估问题。该算法的另一种修改是将次关键路径计算为第二长路径。由于许多研究和开发项目的随机性可能导致在某个时间点次临界成为关键路径,因此将这些路径用于叠加。因此,应考虑次关键路径对项目工期的影响,在这种情况下,应使用叠加方法。模型中使用的叠加基于分析方法-Clark公式。提出的模型可用于业务流程改进和项目管理支持。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号