New answers tagged scheduling
4
Can anyone think about a better formulation?
Another option is to use binary variables $x_{it}$ that take value $1$ if task $i$ starts at time $t$. You then need two sets of constraints:
one start time per task:
$$
\sum_{t}x_{it} = 1 \quad \forall i
$$
don't overlap tasks:
$$
\sum_{i}\sum_{k, t+1 - d_i \le k \le t}x_{ik} \le 1 \quad \forall t
$$
This ...
Top 50 recent answers are included
