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.