A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network

European Journal of Operational Research

Volumn 114, Issue 3, 1999, Pages 610-625

  Fatemi Ghomi, S M T ^a   Hashemin, S S ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Analytical algorithm; Distribution function; Gaussian quadrature formula; Multiple integrals; Network completion time

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FUNCTIONS; GRAPH THEORY; INTEGRAL EQUATIONS; MONTE CARLO METHODS; PROBLEM SOLVING;

ANALYTICAL ALGORITHMS; DISTRIBUTION FUNCTIONS; GAUSSIAN QUADRATURE FORMULA; MULTIPLE INTEGRALS; NETWORK COMPLETION TIME;

RANDOM PROCESSES;

EID: 0033132231     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00197-0     Document Type: Article

References (19)

1. Burt J.M. Jr., Garman M.B. Monte Carlo techniques for stochastic PERT network analysis. INFOR. 9:1971;248-262.
2. Burt J.M. Jr., Garman M.B. Conditional Monte Carlo: A simulation technique for stochastic network analysis. Management Science. 18:1971;207-217.
3. Clingen C.T. A modification of Fulkerson's PERT algorithm. Operations Research. 12:1964;629-632.
4. O'Conner, D.R., 1981. Exact distributions of stochastic PERT networks. University of College of Dublin, Belfield, Dublin 4, Ireland.
5. Devroye L.P. Inequalities for the completion times of stochastic PERT network. Mathematics of Operations Research. 4:1980;441-447.
6. Dodin B. Approximating the distribution functions in stochastic networks. Computers & Operations Research. 12:1985;251-264.
7. Elmaghraby S.E. On the expected duration of PERT type networks. Management Science. 13:1967;299-306.
8. Elmaghraby, S.E., 1977. Activity Networks: Project Planning and Control by Network Models. Wiley, New York.
9. Fulkerson D.R. Expected critical path lengths in PERT networks. Operations Research. 10:1962;808-817.
10. Hartley H.O., Wortham A.W. A statistical theory for PERT critical path analysis. Management Science. 12:1966;469-481.
11. Kleindorfer G.B. Bounding distributions for a stochastic acyclic network. Operations Research. 19:1971;1586-1601.
12. Malcolm D.J., Roseboom J.H., Clark C.E., Fazar W. Applications of a technique for research and development program evaluation. Operations Research. 7:1959;646-669.
13. Martin J.J. Distribution of the time through a directed, acyclic network. Operations Research. 13:1965;46-66.
14. Ringer L.J. Numerical operators for statistical PERT critical path analysis. Management Science. 16:1969;136-143.
15. Ringer L.J. A statistical theory for PERT in which completion times of activities are inter-dependent. Management Science. 17:1971;717-723.
16. Robillard P., Trahan M. Expected completion time in PERT networks. Operations Research. 24:1976;177-182.
17. Shogan A.W. Bounding distributions for a stochastic PERT network. Network. 7:1977;359-381.
18. Sigal C.E., Pritsker A.A.B., Solberg J.J. The use of cutset in Monte Carlo analysis of stochastic networks. Mathematics and Computers in Simulation. 21:1979;376-384.
19. Van Slyke R.M. Monte Carlo methods and the PERT problem. Operations Research. 11:1963;839-860.