Advertisement

OR-Spektrum

, Volume 23, Issue 3, pp 297–324 | Cite as

Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling

  • Birger Franck
  • Klaus Neumann
  • Christoph Schwindt
Original Papers

Abstract.

We present heuristic procedures for approximately solving large project scheduling problems with general temporal and resource constraints. In particular, we propose several truncated branch-and-bound techniques, priority-rule methods, and schedule-improvement procedures of types tabu search and genetic algorithm. A detailed experimental performance analysis compares the different heuristics devised and shows that large problem instances with up to 1000 activities and several resources can efficiently be solved with sufficient accuracy.

Key words: Resource-constrained project scheduling – Truncated branch-and-bound – Priority-rule methods – Tabu search – Genetic algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Birger Franck
    • 1
  • Klaus Neumann
    • 1
  • Christoph Schwindt
    • 1
  1. 1.Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 76128 Karlsruhe, Germany (e-mail: {franck,neumann,schwindt}@wior.uni-karlsruhe.de) Germany

Personalised recommendations