Skip to main content
SpringerLink
Log in

On Stochastic Analysis of Project-Networks

  • Conference paper
Book cover Deterministic and Stochastic Scheduling

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 84))

Abstract

If the activity-completion-times of a project-network are random variables the project-completion-time is a random variable the distribution function of which is difficult to obtain. Thus, efforts have been made to determine bounds for the mean and bounding distribution functions for the distribution function of the project-completion-time some results of which are shortly surveyed. Then, a new approach using stochastic programming for a cost-oriented project scheduling model is presented. Generalizing a well-known Fulkerson-approach planned execution-times for the random activity-completion-times are computed where nonconformity with the actual realizations impose compensation costs (gains). Taking into consideration a prescribed project-completion-time constraint the expected costs for performing the activities ac-cording to the planned executions-times are minimized. A solution procedure is described which constructs a sequence of nonstochastic Fulkerson project scheduling models. It is demonstrated by means of an example.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Charnes, A., Cooper, W.W., Thompson, G.L. (1964) Critical Path Analysis via Chance-Constrained and Stochastic Programming. Operations Research 12, pp. 460–470.

    Article  MathSciNet  MATH  Google Scholar 

  2. Cleef, H.J. (1981) A Solution Procedure for the Two-Stage Stochastic Program with Simple Recourse. Zeitschrift für Operations Research 25, pp. 1–13.

    Article  MathSciNet  MATH  Google Scholar 

  3. Cleef, H.J., Gaul, W. (1980) Project Scheduling via Stochastic Programming. SFB-72-Preprint 367, University of Bonn.

    Google Scholar 

  4. Clingen, C.T. (1964) A Modification of Fulkerson’s PERT Algorithm. Operations Research 12, pp. 629–632.

    Article  MATH  Google Scholar 

  5. Devroye, L.P. (1979) Inequalities for the Completion Times of Stochastic PERT Networks. Mathematics of Operations Research 4, pp. 441–447.

    Article  MathSciNet  MATH  Google Scholar 

  6. Ford, L.R., Fulkerson, D.R. (1962) Flows in Networks. Princeton University Press.

    Google Scholar 

  7. Fulkerson, D.R. (1961) A Network Flow Computation for Project Cost Curves. Management Sc. 7, pp. 167–178.

    Article  MathSciNet  MATH  Google Scholar 

  8. Fulkerson, D.R. (1962) Expected Critical Path Length in PERT Type Networks. Operations Research 10, pp. 808–817.

    Article  MATH  Google Scholar 

  9. Fulkerson, D.R. (1964) Scheduling in Project Networks. Proc. IBM Scient. Comp. Symp. Comb. Problems, pp. 73-92.

    Google Scholar 

  10. Gaul, W. (1981a) Bounds for the Expected Duration of a Stochastic Project Planning Model. J. Infor. & Optimiz. Sc. 2, pp. 45–63.

    MathSciNet  MATH  Google Scholar 

  11. Gaul, W. (1981 b) Stochastische Projektplanung und Marketingprobleme. Paper presented at: 6. Symposium Operations Research, Augsburg.

    Google Scholar 

  12. Harary, F., Norman, F.Z., Cartwright, D. (1965) Structural Models: An Introduction to the Theory of Directed Graphs. Wiley.

    Google Scholar 

  13. Kall, P. (1976) Stochastic Linear Programming. Springer Verlag.

    Google Scholar 

  14. Kleindorfer, G.B. (1971) Bounding Distributions for a Stochastic Acyclic Network. Operations Research 19, pp. 1586–1601.

    Article  MathSciNet  MATH  Google Scholar 

  15. Neumann, K., Steinhardt, U. (1975) GERT-Networks and the Time-Oriented Evaluation of Projects. Lecture Notes in Economics and Mathematical Systems 172. Springer Verlag.

    Google Scholar 

  16. Robillard, P., Trahan, M. (1976) Expected Completion Time in PERT Networks. Operations Research 24, pp. 177–182.

    Article  MathSciNet  MATH  Google Scholar 

  17. Robillard, P., Trahan, M. (1977) The Completion Time of PERT Networks. Operations Research 25, pp. 15–29.

    Article  MATH  Google Scholar 

  18. Shogan, A.W. (1977) Bounding Distributions for a Stochastic PERT Network. Networks 7, pp. 359–381.

    Article  MathSciNet  MATH  Google Scholar 

  19. Stancu-Minasian, I.M., Wets, M.J. (1976) A Research Bibliography in Stochastic Programming. Operations Research 24, pp. 1078–1119.

    Article  MathSciNet  Google Scholar 

  20. Van Slyke, R.M. (1963) Monte Carlo Methods and the PERT Problem. Operations Research 11, pp. 839–860.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Karlsruhe, Germany

    W. Gaul

Authors
  1. W. Gaul
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada

    M. A. H. Dempster

  2. Balliol College, Oxford, England

    M. A. H. Dempster

  3. Mathematisch Centrum, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    J. K. Lenstra

  4. Econometric Institute H2-11, Erasmus University, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands

    A. H. G. Rinnooy Kan

Rights and permissions

Reprints and permissions

Copyright information

© 1982 D. Reidel Publishing Company

About this paper

Cite this paper

Gaul, W. (1982). On Stochastic Analysis of Project-Networks. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds) Deterministic and Stochastic Scheduling. NATO Advanced Study Institutes Series, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7801-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7801-0_16

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-7803-4

  • Online ISBN: 978-94-009-7801-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation