A decomposition approach for a resource constrained scheduling problem

The basic algorithms to be used by a Decision Support System for a resource constrained scheduling problem are described. The algorithmic approach is based upon a decomposition of the problem which adheres to the associated decision process. Combinatorial algorithms are introduced in order to support each of the resulting subproblems. Moreover it is shown how to improve the solutions by letting the subproblems interact with each other.