A Critique of Project Planning with Constrained Resources

This paper surveys the current research in resource constrained project scheduling. Although CPM and PERT have gained wide acceptance and use, the problem of limiting resources used by each activity remains unsolved for practical-sized problems.

[1]  E. W. Davis,et al.  Project Planning by Network Analysis. , 1972 .

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

[3]  Joseph J. Moder,et al.  Project Management with CPM and PERT , 1964 .

[4]  Egon Balas,et al.  Discrete Programming by the Filter Method , 1967, Oper. Res..

[5]  E. Beale,et al.  Applications of Mathematical Programming Techniques. , 1971 .

[6]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[7]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[8]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

[9]  Jerome D. Wiest.  Some Properties of Schedules for Large Projects with Limited Resources , 1964 .

[10]  Victor Zaloom,et al.  On the Resource Constrained Project Scheduling Problem , 1971 .

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

[12]  S. Lambourn,et al.  Resource allocation and multi-project scheduling (RAMPS) - a new tool in planning and control , 1963, Computer/law journal.

[13]  Egon Balas,et al.  PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS. , 1968 .

[14]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[15]  W. Karush.  ON SCHEDULING A NETWORK OF ACTIVITIES UNDER RESOURCE RESTRAINTS OVER TIME , 1966 .

[16]  J.-F. Raimond.  Minimaximal paths in disjunctive graphs by direct search , 1969 .

[17]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

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

[19]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[20]  M. E. Terry,et al.  Proceedings of the Inaugural Conference of the Scientific Computation Center and the Institute of Statistical Studies and Research. , 1972 .

[21]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[22]  Michael Florian,et al.  A Direct Search Method to Locate Negative Cycles in a Graph , 1971 .

[23]  T. C. Hu.  Letter to the Editor-On the Feasibility of Simultaneous Flows in a Network , 1964 .

[24]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

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

[26]  Thomas Joel Russell Johnson,et al.  An algorithm for the resource constrained project scheduling problem , 1967 .

[27]  F K Levy,et al.  Multiship, multishop, workload‐smoothing progfum , 1962 .

[28]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[29]  Chris Chapman.  The Optimal Allocation of Resources to a Variable Timetable , 1970 .

[30]  Harold H. Greenberg,et al.  A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..

[31]  Samuel Corenstein.  An Algorithm for Project (Job) Sequencing with Resource Constraints , 1972, Oper. Res..

[32]  Colin L. Moodie,et al.  A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling , 1971 .

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

[34]  E. Balas.  Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs , 1970 .

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