Article ID: | iaor20108917 |
Volume: | 181 |
Issue: | 1 |
Start Page Number: | 503 |
End Page Number: | 514 |
Publication Date: | Dec 2010 |
Journal: | Annals of Operations Research |
Authors: | Abdelkader H |
Keywords: | networks |
The problem of determining the moment of the project completion time (MPCT) with stochastic activity durations is addressed. In the direct approach the MPCT is obtained after analyzing all possible network paths which is NP-hard problem. A recursive method for determining MPCT by proceeding iteratively over the nodes is the computationally least demanding and therefore the most efficient approach. Unfortunately, the moment methods which are available in literature ignore some aspects. In this paper, an adjustment of the moment completion time is discussed. Two illustrative examples are presented.