Summary and Info
We describe a time-oriented branch-and-bound algorithm for the resource-constrained project scheduling problem which explores the set of active schedules by enumerating possible activity start times. The algorithm uses constraint-propagation techniques that exploit the temporal and resource constraints of the problem in order to reduce the search space. Computational experiments with large, systematically generated benchmark test sets, ranging in size from thirty to one hundred and twenty activities per problem instance, show that the algorithm scales well and is competitive with other exact solution approaches. The computational results show that the most difficult problems occur when scarce resource supply and the structure of the resource demand cause a problem to be highly disjunctive.
More About the Author
Dorndorf-Steudnitz is a former municipality in the district Saale-Holzland, in Thuringia, Germany. Since 1 December 2008, it is part of the town Dornburg-Camburg.
Review and Comments
Rate the Book
A branch-and-bound algorithm for the resource-constrained project scheduling problem 0 out of 5 stars based on 0 ratings.