Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/13133
Title: | Application of modified shortest path algorithm for project duration assessment | Authors: | Dobrilović, Dalibor Jevtić, Vesna Stojanov, Jelena |
Issue Date: | 11-Jul-2011 | Journal: | SACI 2011 - 6th IEEE International Symposium on Applied Computational Intelligence and Informatics, Proceedings | Abstract: | As one of the triple constraint of project management, project completion time is very important issue. This is considerable for wide range of projects, especially for the time-terminated ones. Beside standard network planning methods, such as CPM, PERT, PDM etc. there are variety of alternative methods, based on previous ones, which are used in order to obtain even better project duration evaluations. In these methods researchers includes simulation, fuzzy theory, genetic algorithms etc. This paper describes the approach in modification of shortest path search algorithms and their usage in project duration assessment. Presented modification of shortest path algorithms is focused on its conversion to finding longest path in the network diagram i.e. to finding critical path of the project. © 2011 IEEE. | URI: | https://open.uns.ac.rs/handle/123456789/13133 | ISBN: | 9781424491094 | DOI: | 10.1109/SACI.2011.5873054 |
Appears in Collections: | TFZR Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
3
checked on Nov 20, 2023
Page view(s)
28
Last Week
9
9
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.