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

Erik L. Demeulemeester and Willy S. Herroelen
Additional contact information
Erik L. Demeulemeester: Katholieke Universiteit Leuven, Leuven, Belgium
Willy S. Herroelen: Katholieke Universiteit Leuven, Leuven, Belgium

Operations Research, 1997, vol. 45, issue 2, 201-212

Abstract: 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.

Keywords: project management; generalized resource-constrained project scheduling; programming; branch-and-bound; networks/graphs; precedence diagramming (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.2.201 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:45:y:1997:i:2:p:201-212

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().