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

Autor(en): Brucker, P.
Knust, S. 
Schoo, A.
Thiele, O.
Stichwörter: Constraint propagation; Resource-constrained project scheduling
Erscheinungsdatum: 2000
Journal: Mathematical Methods of Operations Research
Volumen: 52
Ausgabe: 3
Startseite: 413
Seitenende: 439
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.
ISSN: 14322994
DOI: 10.1007/s001860000091
Externe URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-0038708604&doi=10.1007%2fs001860000091&partnerID=40&md5=bb14a93398d6cfdfc1a48ed4e588503f

Show full item record

Page view(s)

Last Week
Last month
checked on Apr 17, 2024

Google ScholarTM