This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, at its core, on a constraint satisfaction problem solving (CSP) search procedure, which generates a consistent set of activity start times by incrementally removing resource conflicts from an otherwise temporally feasible solution. Key to the effectiveness of the CSP search procedure is its heuristic strategy for conflict selection. A conflict sampling method biased toward selection of minimal conflict sets that involve activities with higher-capacity requests is introduced, and coupled with a non-deterministic choice heuristic to guide the base conflict resolution process. This CSP search is then embedded within a larger iterative-sampling search framework to broaden search space coverage and promote solution optimization. The efficacy of the overall heuristic algorithm is demonstrated empirically on a large set of previously studied RCPSP/max benchmark problems.
A constraint-based method for project scheduling with time windows
Kluwer Academic Publishers, Boston , Stati Uniti d'America
Journal of heuristics 8 (2002): 109–136. doi:10.1023/A:1013617802515
info:cnr-pdr/source/autori:Cesta, A; Oddi, A; Smith, SF/titolo:A constraint-based method for project scheduling with time windows/doi:10.1023/A:1013617802515/rivista:Journal of heuristics/anno:2002/pagina_da:109/pagina_a:136/intervallo_pagine:109–136/volu