Optimization guided lower and upper bounds for the resource investment problem

The resource investment problem deals with the issue of providing resources to a project such that a given deadline can be met. The objective is to make the resources available in the cheapest possible way. For each resource, expenses depend on the maximum amount required during the course of the project. In this paper we develop two lower bounds for this NP-hard problem using Lagrangean relaxation and column generation techniques, respectively. Both procedures are capable of yielding feasible solutions as well. Hence, we also have two optimization guided heuristics. A computational study consisting of a set of 3210 instances compares both approaches and allows insight into the performance.

[1]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[2]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[3]  Maciej M. Syslo,et al.  On the computational complexity of the minimum-dummy-activities problem in a pert network , 1984, Networks.

[4]  François Soumis,et al.  Decomposition and Column Generation , 1997 .

[5]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[6]  K. Borgwardt.  The Simplex Method: A Probabilistic Analysis , 1986 .

[7]  Andrew V. Goldberg,et al.  On Implementing Push-Relabel Method for the Maximum Flow Problem , 1995, IPCO.

[8]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[9]  Rolf H. Möhring,et al.  Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time , 1984, Oper. Res..

[10]  Rolf H. Möhring,et al.  Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems , 1999, ESA.

[11]  Mark M. Klein,et al.  Scheduling project networks , 1967, CACM.

[12]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[13]  R. Shamir.  The Efficiency of the Simplex Method: A Survey , 1987 .

[14]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

[15]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[16]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..