DocumentCode
3543050
Title
Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition
Author
Jevtic, Vesna ; Dobrilovic, Dalibor ; Stojanov, Jelena ; Stojanov, Zeljko
Author_Institution
Tech. Fac. Mihajlo Pupin, Univ. of Novi Sad, Zrenjanin, Serbia
fYear
2011
fDate
26-29 Sept. 2011
Firstpage
87
Lastpage
90
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.
Keywords
business process re-engineering; graph theory; optimisation; project management; research and development management; Clark formula; Dijkstra algorithm; business process improvement; critical path calculation; project duration assessment model; project management support; research and development project; shortest path algorithm; sub critical path calculation; superposition; Computational modeling; Monte Carlo methods; Planning; Project management; Random variables; Research and development; Clark´s formulas; project duration assessment; shortest path algorithm; superposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4673-0207-4
Type
conf
DOI
10.1109/SYNASC.2011.29
Filename
6169506
Link To Document