Table 2 RCPSP parameters used in the PRI69 time-index formulation.
From: Solving the resource constrained project scheduling problem with quantum annealing
Notation | Definition |
|---|---|
n | Number of activities (excluding the two dummy activities indexed by 0 and \(n+1\)). |
\(\mathcal {T}\) | Maximum number of time periods. |
\(\mathcal {A}\) | Set of activities. |
\(\mathcal {H}\) | \(\mathcal {H} = {0, 1,..., T}\) is the scheduling horizon. |
\(\mathcal {E}\) | Set of edges representing a precedence relationship between two activities. For instance, if i and j are two activities of \(\mathcal {A}\), and if activity i must be finished to start activity j, \((i,j) \in \mathcal {E}\). |
\(\mathcal {R}\) | Set of resources. |
\(p_i\) | Processing time of the activity \(i \in \mathcal {A}\). |
\(B_k\) | Capacity of the resource \(k, k \in \mathcal {R}\). |
\(b_{ik}\) | Activity i consumption of the resource \(k \in \mathcal {R}\) and its capacity \(B_k\). |
