Network Based Planning Techniques: A Critical Review of Published Developments

Three areas of development of network planning are discussed; methods for handling uncertain activity durations, optimal planning when there are alternative time-cost options for some activities and planning when there are resource constraints. A review of published work in each area is given and illustrated by examples. An overview of the whole field is also presented.

[1]  K. Hall,et al.  RECENT ADVANCES IN NETWORK OPTIMIZATION METHODS AND APPLICATIONS , 1984 .

[2]  James Herbert Patterson,et al.  Alternate Methods of Project Scheduling with Limited Resources , 1973 .

[3]  D. Malcolm,et al.  Application of a Technique for Research and Development Program Evaluation , 1959 .

[4]  Jh Gordon.  Heuristic methods in resource allocation , 1983 .

[5]  Bruce M. Woodworth,et al.  A HEURISTIC ALGORITHM FOR RESOURCE LEVELING IN MULTI-PROJECT, MULTI-RESOURCE SCHEDULING , 1975 .

[6]  Edward W. Davis,et al.  An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints , 1971 .

[7]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[8]  Wallace B. S. Crowston,et al.  Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects , 1967, Oper. Res..

[9]  Robert C. Leachman.  Multiple resource leveling in construction systems through variation of activity intensities , 1983 .

[10]  Roman Słowiński,et al.  Two Approaches to Problems of Resource Allocation Among Project Activities — A Comparative Study , 1980 .

[11]  John M. Burt,et al.  Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis , 1971 .

[12]  D. R. Fulkerson.  A Network Flow Computation for Project Cost Curves , 1961 .

[13]  Carl W. Gooding,et al.  Reducing project duration at minimum cost: A time-cost tradeoff algorithm , 1975 .

[14]  Thomas M. Cook,et al.  Estimating a Project's Completion Time Distribution Using Intelligent Simulation Methods , 1979 .

[15]  J. D. Wiest,et al.  A Heuristic Model for Scheduling Large Projects with Limited Resources , 1967 .

[16]  Van Slyke,et al.  MONTE CARLO METHODS AND THE PERT PROBLEM , 1963 .

[17]  J. J. Martin.  Distribution of the Time Through a Directed, Acyclic Network , 1965 .

[18]  S. K. Goyal.  Note---A Note on “A Simple CPM Time-Cost Tradeoff Algorithm” , 1975 .

[19]  K. MacCrimmon,et al.  An Analytical Study of the PERT Assumptions , 1964 .

[20]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[21]  E. M. Davies.  An Experimental Investigation of Resource Allocation in Multiactivity Projects , 1973 .

[22]  M. Dessouky,et al.  Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept , 1977 .

[23]  Chris Chapman,et al.  Progressive Basic Decision CPM , 1972 .

[24]  James H. Patterson,et al.  A Horizon-Varying, Zero-One Approach to Project Scheduling , 1974 .

[25]  R. Słowiński.  Multiobjective network scheduling with efficient use of renewable and nonrenewable resources , 1981 .

[26]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[27]  D R Fulkerson.  SCHEDULING IN PROJECT NETWORKS , 1964 .

[28]  James H. Patterson,et al.  An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems , 1978 .

[29]  Edward W. Davis,et al.  Project Network Summary Measures Constrained- Resource Scheduling , 1975 .

[30]  S. Elmaghraby.  On the Expected Duration of PERT Type Networks , 1967 .

[31]  S. Tufekci.  A Flow-Preserving Algorithm for the Time-Cost Trade-Off Problem , 1982 .

[32]  N. A. J. Hastings,et al.  On Resource Allocation in Project Networks , 1972 .

[33]  Charles A. Holloway,et al.  Comparison of a Multi-Pass Heuristic Decomposition Procedure with Other Resource-Constrained Project Scheduling Procedures , 1979 .

[34]  William J. Abernathy,et al.  Simplification Activities in a Network Scheduling Context , 1973 .

[35]  Pierre N. Robillard,et al.  Technical Note - Expected Completion Time in Pert Networks , 1976, Oper. Res..

[36]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[37]  Augustine O. Esogbue,et al.  Dynamic Programming Models of the Nonserial Critical Path-Cost Problem , 1977 .

[38]  Paul R. Kleindorfer,et al.  Bounding Distributions for Stochastic Logic Networks , 1974 .

[39]  Richard M. Van Slyke,et al.  Letter to the Editor---Monte Carlo Methods and the PERT Problem , 1963 .

[40]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[41]  Nicolai Siemens.  A Simple CPM Time-Cost Tradeoff Algorithm , 1971 .

[42]  J. Horowitz,et al.  Critical Path Problems with Concave Cost-Time Curves , 1972 .

[43]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .