Scheduling and Financial Planning in Stochastic Activity Networks

  • Bajis M. DodinEmail author
  • Abdelghani A. Elimam
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 200)


Stochastic Activity Networks (SANs) deal with projects where the required duration or resources for some or all activities are given as random variables characterized by their own probability distribution functions (pdfs). Managing a SAN project requires dealing with several important issues. One of the primary issues is the determination of the optimal project financial plan for a selected planned budget (PB) and the corresponding project schedule and completion time.

In this chapter, we analyze the impact of the stochastic variations of the renewable and nonrenewable resources required by each activity on the cost and the duration of the project. The investigation resulted in developing an analytical approach for determining the probability density functions of the project cost and duration that can be used in financial planning and scheduling of stochastic projects. A linear programming model was also developed to distribute the resulting project budget over its activities while minimizing the overall project completion time. An example SAN project is provided to illustrate the validity and merit of the approach.


Project Scheduling Financial Planning Probability Distribution Function Duration Linear Programming Convolutions 


  1. Benati, S. (2006). An optimization model for stochastic project network with cash flows. Comput- ational Management Science, 3(4), 271–284.Google Scholar
  2. Dayanand, N., & Padman, R. (1998). On payment schedules in contractor client negotiations in projects: An overview and research issues. In Weglarz J. (Ed.), Project scheduling: Recent models, algorithms and applications. Boston: Kluwer Academic Publishers.Google Scholar
  3. Demeulemeester, E. L., & Herroelen, W. S. (2002). Project scheduling: A research handbook. Boston: Kluwers’s International Series; Kluwer Academic Publishers.Google Scholar
  4. Dodin, B. (1984). Determining the K most critical paths in PERT networks. Operations Research, 32(4), 859–877.Google Scholar
  5. Dodin, B. (1985). Approximating the distribution function in stochastic networks. Computers & Operations Research, 12(3), 251–264.Google Scholar
  6. Dodin, B., & Elimam, A. A. (1997). Audit scheduling with set-up costs and overlapping relationships. European Journal of Operational Research, 97, 22–33.Google Scholar
  7. Dodin, B., & Elmaghraby, S. E. (1985). Approximating the criticality indices of the activities in PERT networks. Management Science, 13(2), 207–223.Google Scholar
  8. Dodin, B., & Servanci, M. (1990). Stochastic networks and the extreme value distribution. Computers & Operations Research, 17(4), 397–409.Google Scholar
  9. Elmaghraby, E. E. (1964). An algebra for the analysis of generalized activity networks. Management Science, 10(3), 494–914.Google Scholar
  10. Elmaghraby, S. E. (1977). Activity networks: Project planning and control by network models. New York: Wiley- Interscience.Google Scholar
  11. Ford, L. R. Jr., & Fulkerson, D. R. (1962). Flows in networks. New Jersey: Princeton U. P., Princeton.Google Scholar
  12. Herroelen, W., & Leus, W. S. (2005). Project scheduling under uncertainty: Survey and research potential. European Journal of Operational Research, 165(2), 289–306.Google Scholar
  13. Neumann, K. (1999). Scheduling of projects with stochastic evolution structure. In Weglarz J. (Ed.), Project scheduling—recent models, algorithms and applications, (pp. 309–332). Boston: Kluwer Academic Publishers (Chapter 14).Google Scholar
  14. Pritsker, A. A. B., & Sigel, C. E. (1974). The GERT IIIZ user’s manual, Pritsker and Associates, Inc. 1201 Wiley Drive, West Lafayette, Indiana.Google Scholar
  15. Pritsker, A. A. B., & Whitehouse, G. E. (1966). GERT: Graphical evaluation and review technique, Part II, probabilistic and industrial engineering applications. Journal of Industrial and Engineering, 17(6), 293–301.Google Scholar
  16. Sobel, M. J., Szmerekovsky, J. G., & Tilson, V. (2009). Scheduling projects with stochastic activity duration to maximize net present value. European Journal of Operational Research, 198(3), 697–707.Google Scholar
  17. Wallace, S. W. (1989). Bounding the expected time- cost curve for stochastic pert networks from below. Operations Research Letters, 8(2), 89–94.Google Scholar
  18. Wiesemann, W., Huhn, D., & Rustem, B. (2010). Maximizing the net present value of a project under uncertainty. European Journal of Operational Research, 202(2), 356–367.Google Scholar
  19. Wollmer, R. D. (1985). Critical Path Planning Under Uncertainty. Mathematical Programming Study, 25, 164–171.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.The A. Gary Anderson Graduate School of ManagementUniversity of CaliforniaRiverside RiversideUSA
  2. 2.School of Science and Engineering, Mechanical Engineering DepartmentAmerican UniversityCairoEgypt

Personalised recommendations