By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Vesna Jevtic ; Tech. Fac. Mihajlo Pupin, Univ. of Novi Sad, Zrenjanin, Serbia ; Dalibor Dobrilovic ; Jelena Stojanov ; Zeljko Stojanov

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.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on

Date of Conference:

26-29 Sept. 2011