# Tag Info

Accepted

• 8,950
1 vote
Accepted

### How to define the sequence depending setup time based on a time index formulation

Here is a way to model sequence-dependent setup times for a time-indexed formulation:  \forall j, j' \in J, j \neq j' \quad \forall m \in M, \quad \forall t \in T, \qquad x_{j, m, t} + \sum_{t' = t +...
• 2,623
1 vote

### Scheduling repeated tasks with minimum duty cycles

The repeating time frame is called cyclic scheduling. The max distance between tasks is called max delay. CP-SAT is a good tool to model it. You will need to use interval variables, the no_overlap ...
• 2,720
1 vote

### How to fill the days in sequence?

$-20x_i \le 20-\sum_{d}^{i-1} h_d - 8 \le 20(1-x_i)$ $8(1-x_i) \le h_i \le 20-\sum_{d}^{i-1} h_d$ where $x_i$ is a binary
• 3,485
1 vote

### How to fill the days in sequence?

If the work load can be discretized, you could model this like a bin packing problem. If the time granularity is for example the hour, let $x_{ij}$ be a binary variable that takes value $1$ if and ...
• 13.5k

Only top scored, non community-wiki answers of a minimum length are eligible