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

V. Jevtic, D. Dobrilović, Jelena Stojanov, Ž. Stojanov
{"title":"Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition","authors":"V. Jevtic, D. Dobrilović, Jelena Stojanov, Ž. Stojanov","doi":"10.1109/SYNASC.2011.29","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"7 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2011.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

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算法进行了改进。用于关键路径计算,即解决项目工期评估问题。算法的另一个改进是计算亚关键路径作为第二长的路径。这些路径用于叠加,因为许多研究和开发项目的随机性可能导致在某个时间点亚临界路径成为关键路径。因此,应考虑亚关键路径对项目持续时间的影响,在这种情况下,使用叠加。模型中使用的叠加是基于解析方法——克拉克公式。所提出的模型可用于业务流程改进和项目管理支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信