Resource Constrained Project Success Plan

Scheduling tasks in a large project translates to facing a graph optimization challenge:

The Resource-Constrained Project Scheduling Problem is a combinatorial optimization problem that consists of finding a feasible scheduling for a set of \(n\) jobs subject to resource and precedence constraints.

Problem Domain: Network Optimization.

Taks are represented by nodes. Dependencies of tasks on predecessors form a directed graph. Every task has got a duration which is represented by the weight of the directed edges of the graph. Tasks consume limited resources. In order to provide an entry and exit point to the graph we introduce two dummy tasks, \(x_0, x_{n+1}\) with duration 0 and no resource consumption (a.k.a. sentinels).