A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

In this paper a branch-and-bound procedure is described for scheduling project activities subject to precedence diagramming type of precedence relations, ready times, due dates, and variable multiple resource availability constraints, where the objective is to minimize project duration. The procedure is based on a depth-first solution strategy in which nodes in the solution tree represent resource and precedence feasible partial schedules. Branches emanating from a parent node correspond to exhaustive and minimal combinations of activities, the delay of which resolves resource conflicts at each parent node. A precedence based lower bound and several dominance rules are introduced in order to restrict the growth of the solutions tree. The procedure has been programmed in the C language. Extensive computational experience is reported.

[1]  Willy Herroelen,et al.  Resource-constrained Project Scheduling — The State of the Art , 1972 .

[2]  Erik Demeulemeester,et al.  Recent Advances in Branch-and-Bound Procedures for Resource-Constrained Project Scheduling Problems , 1992 .

[3]  W. P. Simpson,et al.  On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem , 1994 .

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

[5]  F. J. Radermacher,et al.  Chapter 2 – THE ORDER-THEORETIC APPROACH TO SCHEDULING: THE DETERMINISTIC CASE , 1989 .

[6]  Willy Herroelen,et al.  An evaluation of microcomputer-based software packages for project management , 1990 .

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

[8]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

[9]  N. A. J. Hastings,et al.  On Resource Allocation in Project Networks , 1972 .

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

[11]  S. Elmaghraby,et al.  The Analysis of Activity Networks Under Generalized Precedence Relations GPRs , 1992 .

[12]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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

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

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

[16]  F. Radermacher.  Scheduling of project networks , 1985 .