A branch-and-bound procedure for the generalized resource-constrained project scheduling problem

A branch-and-bound procedure for the generalized resource-constrained project scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20003463
Country: United States
Volume: 45
Issue: 2
Start Page Number: 201
End Page Number: 212
Publication Date: Mar 1997
Journal: Operations Research
Authors: ,
Keywords: programming: branch and bound
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.

Reviews

Required fields are marked *. Your email address will not be published.