Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
- 351 Downloads
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.
Unable to display preview. Download preview PDF.