An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

In this paper we consider the Project Scheduling Problem with resource constraints, where the objective is to minimize the project makespan. We present a new 0-1 linear programming formulation of the problem that requires an exponential number of variables, corresponding to all feasible subsets of activities that can be simultaneously executed without violating resource or precedence constraints. Different relaxations of the above formulation are used to derive new lower bounds, which dominate the value of the longest path on the precedence graph and are tighter than the bound proposed by Stinson et al. (1978). A tree search algorithm, based on the above formulation, that uses new lower bounds and dominance criteria is also presented. Computational results indicate that the exact algorithm can solve hard instances that cannot be solved by the best algorithms reported in the literature.

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

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

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

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

[5]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Preemptive Case , 1972, Oper. Res..

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

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

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

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

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

[11]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[12]  James H. Patterson,et al.  Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming Approach , 1976 .

[13]  Arne Thesen,et al.  Heuristic Scheduling of Activities under Resource and Precedence Restrictions , 1976 .

[14]  Dale F. Cooper,et al.  Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation , 1976 .

[15]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

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

[17]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

[18]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

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

[20]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[21]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[23]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[24]  F. F. Boctor,et al.  Some efficient multi-heuristic procedures for resource-constrained project scheduling , 1990 .

[25]  Colin E. Bell,et al.  Solving resource-constrained project scheduling problems by A* search , 1990 .

[26]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[27]  Colin E. Bell,et al.  A new heuristic solution method in resource‐constrained project scheduling , 1991 .

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

[29]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[30]  Osman Oguz,et al.  A comparative study of computational procedures for the resource constrained project scheduling problem , 1994 .

[31]  Jue Xue,et al.  Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem , 1994, Networks.

[32]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..