A branch-and-bound algorithm for the resource-constrained project scheduling problem |
| |
Authors: | U Dorndorf E Pesch T Phan-Huy |
| |
Institution: | (1) University of Bonn, Faculty of Economics, BWL III, Adenauerallee 24-42, D-53113 Bonn, Germany (e-mail: udorndorf@acm.org, e.pesch@uni-bonn.de, phanhuy@toan.de), DE |
| |
Abstract: | 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. |
| |
Keywords: | : resource-constrained project scheduling constraint propagation |
本文献已被 SpringerLink 等数据库收录! |
|