The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001

[1]  Roman Słowiński,et al.  Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems , 1990 .

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

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

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

[5]  S. Selcuk Erenguc,et al.  A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows , 1996 .

[6]  R. R. Hocking,et al.  Optimum Time Compression in Project Scheduling , 1970 .

[7]  Erik Demeulemeester,et al.  Optimal procedures for the discrete time/cost trade-off problem in project networks , 1996 .

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

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

[10]  Arno Sprecher,et al.  Resource-Constrained Project Scheduling: Exact Methods for the Multi-Mode Case , 1994 .

[11]  E. B. Berman,et al.  Resource Allocation in a PERT Network Under Continuous Activity Time-Cost Functions , 1964 .

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

[13]  James H. Patterson,et al.  Project scheduling: The effects of problem structure on heuristic performance , 1976 .

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

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

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

[17]  J. H. Patterson,et al.  An Algorithm for a general class of precedence and resource constrained scheduling problems , 1989 .

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