ALGORITHMS FOR SCHEDULING PROJECTS WITH LIMITED RESOURCES

During recent years decision procedures for scheduling projects with limited resources have become more complex. It is therefore, desirable to allow for more aspects of the real world when developing such procedures. The present paper begins with a brief survey of the manner in which the above scheduling problem has heretofore been defined and solved. Next, this problem is reformulated in order to allow for the treatment of predicted streams of costs and benefits of a project, as a function of calendar time. The method developed in this paper consists of two algorithms. Application of the first algorithm results in a good initial solution to the scheduling problem and is, therefore, a heuristic procedure. Next, a second algorithm which guarantees an optimal solution is applied to this initial solution. Computational experience with the aforementioned two algorithms indicates that their combined application is an efficient method for scheduling projects with limited resources.

[1]  Henri L. Beenhakker.  Sensitivity Analysis of the Present Value of a Project , 1975 .

[2]  H. L. Beenhakker,et al.  Approaches to dynamic transport planning , 1973 .

[3]  Clifford C. Petersen,et al.  Solving Sequencing Problems Through Reordering Operations , 1973 .

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

[5]  Arthur M. Geoffrion,et al.  An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[6]  George L. Nemhauser,et al.  Letter to the Editor - A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem , 1968, Oper. Res..

[7]  Robert Dorfman,et al.  Design of Water-Resource Systems , 2014 .

[8]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[9]  P. Kolesar.  A Branch and Bound Algorithm for the Knapsack Problem , 1967 .

[10]  Seymour Kaplan.  Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method , 1966, Oper. Res..

[11]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

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

[13]  A. A. Robichek,et al.  Mathematical Programming and the Analysis of Capital Budgeting Problems. , 1965 .

[14]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[15]  G. Mills,et al.  Approaches to Dynamic Investment Planning. , 1963 .

[16]  L. J. Savage,et al.  Three Problems in Rationing Capital , 1955 .