Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Network planning

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_665

Network planning (or project networking) is a generic name for methods that study projects as a set of interconnected activities with the purpose of assisting in planning, managing and controlling projects. These methods are based on models describing projects as activities networks and include well known techniques such as the Critical Path Method (CPM) and the Program Evaluation and Review Technique (PERT). CPM determines the critical path which includes the so-called critical activities (activities deserving maximal attention as any delay causes a delay of the project's completion date), while PERT estimates the probability distribution of the project's completion date. These methods require the determination of each of the activities that are involved in the project, the sequence in which these activities must be performed, and the activities that can be performed concurrently with other activities.

Network planning can study different problems such as project scheduling, risk...

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


  1. [1]
    Boctor, F.F. (1990). “Some efficient multi-heuristic procedures for resource-constrained project scheduling,” European Journal of Operational Research 49, 3–13.Google Scholar
  2. [2]
    Davies, E.M. (1973). “An experimental investigation of resource allocation in multiactivity projects,” Operational Research Quarterly 24, 587–591.Google Scholar
  3. [3]
    de Wit, J. and Herroelen, W. (1990). “An evaluation of microcomputer-based software packages for project management,” European Jl. Operational Research 49, 102–139.Google Scholar
  4. [4]
    Elmaghraby, S.E. (1977). Activity Networks: Project Planning and Control by Network Models, Wiley, New York.Google Scholar
  5. [5]
    Fondahl, J.W. (1961). A noncomputer approach to the Critical Path Method for the construction industry, Dept. of Civil Engineering, Stanford University, Stanford, California.Google Scholar
  6. [6]
    Fulkerson, D.R. (1961). “A network flow computation for project cost curves,” Management Science 7, 167–178.Google Scholar
  7. [7]
    Goldratt, E.M. (1997). Critical Chain, The North River Press, Great Barrington, MA.Google Scholar
  8. [8]
    Golenko-Ginzburg, D. (1989). “PERT assumptions revisited.” Omega 17, 393–396.Google Scholar
  9. [9]
    Kelley, J.E. (1961). “Critical-path planning and scheduling: mathematical basis,” Operations Research 9, 296–320.Google Scholar
  10. [10]
    Kelley, J.E. and Walker, M.R., eds. (1959). “Critical-path planning and scheduling,” In Proceedings of Eastern Joint Computer Conference, Boston, December 1–3, 1959, 160–173. Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    Moder, J.J., Phillips, C.R., and Davis, E.W. (1983). Project Management with CPM, PERT and Precedence Diagramming, Van Nostrand, New York.Google Scholar
  13. [13]
    Patterson, J.H. (1984). “A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem,” Management Science 30, 854–867.Google Scholar
  14. [14]
    Patterson, J.H. and Huber, W.D. (1974). “A horizon-varying, zero-one approach to project scheduling,” Management Science 20, 990–998.Google Scholar
  15. [15]
    Pritsker, A.A.B., Walters, L.J., and Wolfe, P.M. (1969). “Multi-project scheduling with limited resources: a zero-one programming approach,” Management Science 16, 93–108.Google Scholar
  16. [16]
    Probst, A.R. and Worlitzer, J. (1988). Project management and expert systems, International Jl. Project Management 6, 11–17.Google Scholar
  17. [17]
    Ritchie, E. (1985). “Network based planning techniques: a critical review of published developments,” In Further Developments in Operational Research (G.K. Rand and R.W. Eglese, eds.), 34–56. Pergamon, Oxford.Google Scholar
  18. [18]
    Roy, B. (1964). “Contribution de la théorie des graphes a l'étude des problems d'ordonnancement,” In Les problems d'ordonnancement: applications et methodes (B. Roy, ed.), 109–125. Paris, Dunod.Google Scholar
  19. [19]
    Sculli, D. (1989). “A historical note on PERT times,” Omega 17, 195–196.Google Scholar
  20. [20]
    Slowinski, R. and Weglarz, J. (1989). Advances in Project Scheduling, Studies in Production and Engineering Economics, North Holland, Amsterdam.Google Scholar
  21. [21]
    Talbot, F.B. and Patterson, J.H. (1978). An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems, Management Science 24, 1163–1174.Google Scholar
  22. [22]
    Tavares, L.V. (1987). “Optimal resource profiles for program scheduling,” European Jl. Operational Research 29, 83–90.Google Scholar
  23. [23]
    Tavares, L.V. (1989). “A multi-stage model for project scheduling under resource constraints,” In Advances in Project Scheduling (R. Slowinski and J. Weglarz, eds.), 315–326. Amsterdam, The Netherlands, Elsevier Science Publishers.Google Scholar
  24. [24]
    Wasil, E.A. and Assad, A.A. (1988). “Project management on the PC: software, applications, and trends,” Interfaces 18(2), 75–84.Google Scholar
  25. [25]
    Weist, J.D. (1967). “A heuristic model for scheduling large projects with limited resources,” Management Science 13, B369–B377.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Lancaster UniversityLancasterUnited Kingdom
  2. 2.Instituto Superior TécnicoLisbonPortugal