A LABEL-CORRECTING TRACING ALGORITHM FOR THE APPROXIMATION OF THE PROBABILITY DISTRIBUTION FUNCTION OF THE PROJECT COMPLETION TIME

REFERENCES

• Adlakha , V. G. 1989 . A classified bibliography of research on stochastic PERT networks: 1966–1987 . INFOR , 27 : 272 – 296 .
   Web of Science ®Google Scholar
• Agrawal , M. K. and Elmaghraby , S. E. 2001 . On computing the distribution function of the sum of independent random variables . Computers and Operations Research , 28 : 473 – 483 .
   Web of Science ®Google Scholar
• Bellman , R. 1958 . On a routing problem . Quarterly of Applied Mathematics , 16 : 88 – 90 .
   Google Scholar
• Bertsekas , D. P. 1993 . A simple and fast label correcting algorithm for shortest paths . Networks , 23 : 703 – 709 .
   Web of Science ®Google Scholar
• Birge , J. R. and Louveaux , F. 1997 . Introduction to Stochastic Programming New York : Springer Verlag .
   Google Scholar
• Burt , J. M. and Garman , M. B. 1971 . Conditional Monte Carlo: A simulation technique for stochastic network analysis . Management Science , 18 : 207 – 217 .
   Web of Science ®Google Scholar
• Chatzoglou , P. and Macaulay , L. 1996 . A review of existing models for project planning and estimation and the need for a new approach . International Journal of Project Management , 14 : 173 – 183 .
   Google Scholar
• Clark , C. E. 1961 . The greatest of a finite set of random variables . Operations Research , 9 : 146 – 162 .
   Web of Science ®Google Scholar
• Coppendale , J. 1995 . Manage risk in product and process development and avoid unpleasant surprises . Engineering Management Journal , 5 : 35 – 38 .
   Google Scholar
• Dodin , B. M. 1985 . Approximating the distribution function in stochastic networks . Computers and Operations Research , 12 : 251 – 264 .
   Web of Science ®Google Scholar
• Dodin , B. M. and Sirvanci , M. 1990 . Stochastic networks and the extreme value distribution . Computers and Operations Research , 17 : 207 – 217 .
   Web of Science ®Google Scholar
• Elmaghraby , S. E. 1989 . “ The estimation of some network parameters in the PERT model of activity networks: review and critique ” . In Advances in Project Scheduling Edited by: Slowinski , R. and Weglarz , J. 371 – 432 . Amsterdam : Elsevier .
   Google Scholar
• Fisher , D. L. , Saisi , D. and Goldstein , W. M. 1985 . Stochastic PERT networks: OP diagrams critical paths and the project completion time . Computers and Operations Research , 12 : 471 – 482 .
   Web of Science ®Google Scholar
• Gallo , G. and Pallottino , S. 1988 . Shortest path algorithms . Annals of Operations Research , 7 : 3 – 79 .
   Google Scholar
• Glover , F. , Klingman , D. and Philips , N. 1986 . A new polynomial bounded shortest path algorithm . Operations Research , 33 : 65 – 73 .
   Web of Science ®Google Scholar
• Hagstrom , J. N. 1988 . Computational complexity of PERT problems . Networks , 18 : 139 – 147 .
   Web of Science ®Google Scholar
• Hagstrom , J. N. 1990 . Computing the probability distribution of project duration in a PERT network . Networks , 20 : 231 – 244 .
   Web of Science ®Google Scholar
• Kolisch , R. and Sprecher , A. 1996 . PSPLIB-A project scheduling problem library . European Journal of Operational Research , 96 : 205 – 216 .
   Web of Science ®Google Scholar
• Kulkarni , V. G. and Adlakha , V. G. 1986 . Markov and Markov-Regenerative PERT networks . Operations Research , 34 : 769 – 781 .
   Web of Science ®Google Scholar
• Malcolm , D. G. , Roseboom , J. H. , Clark , C. E. and Fazar , W. 1959 . Application of a technique for research and development program evaluation . Operations Research , 7 : 646 – 669 .
   Web of Science ®Google Scholar
• Martin , J. J. 1965 . Distribution of the time through a directed acyclic networks . Operations Research , 13 : 46 – 66 .
   Web of Science ®Google Scholar
• Mehrotra , K. , Chai , J. and Pillutla , S. 1996 . A study of approximating the moments of the job completion time in PERT networks . Journal of Operations Management , 14 : 277 – 289 .
   Google Scholar
• Pape , U. 1974 . Implementation and efficiency of Moore-algorithms for the shortest route problem . Mathematical Programming , 7 : 212 – 222 .
   Google Scholar
• Pontrandolfo , P. 2000 . Project duration in stochastic networks by the PERT-path technique . International Journal of Project Management , 18 : 215 – 222 .
   Google Scholar
• Sculli , D. 1983 . The completion time of PERT networks . Journal of the Operational Research Society , 25 : 155 – 158 .
   Google Scholar
• Sigal , C. E. , Pritsker , A. A.B. and Solberg , J. J. 1979 . The use of cutsets in Monte Carlo analysis of stochastic networks . Mathematics and Computers in Simulation , 21 : 376 – 384 .
   Google Scholar
• Van Slyke , R. M. 1963 . Monte Carlo methods and the PERT problem . Operations Research , 11 : 839 – 861 .
   Web of Science ®Google Scholar