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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: July 26, 2000 / Accepted: May 15, 2001
Rights and permissions
About this article
Cite this article
Franck, B., Neumann, K. & Schwindt, C. Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum 23, 297–324 (2001). https://doi.org/10.1007/PL00013356
Published:
Issue Date:
DOI: https://doi.org/10.1007/PL00013356