Advertisement

Mathematical Methods of Operations Research

, Volume 52, Issue 3, pp 413–439 | Cite as

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

  • U. Dorndorf
  • E. Pesch
  • T. Phan-Huy

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.

Key words: resource-constrained project scheduling, constraint propagation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • U. Dorndorf
    • 1
  • E. Pesch
    • 1
  • T. Phan-Huy
    • 1
  1. 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

Personalised recommendations