Skip to main content
Bumped by Community user
Bumped by Community user
added 121 characters in body
Source Link

I have this constraint which ensures that there are at least $F$ consecutive days off. F.e. for $F=2$, an 1-0-1 is prevented.

$$1+y_{it}\ge y_{i(t-1)}+y_{ik}~\forall i\in I, t\in\left\{ 2,\ldots,T- {F}+1 \right\}, k\in \left\{ t+1,\ldots,t+{F}-1 \right\}$$

I also have this constrainttwo constraints that ensures a minimum number($W$)/maximum ($A$) number of consecutive work days. Is it possible to change my first constraint to a work on, using a summation as in the second constraints?

$$\sum_{j=t}^{t+A}y_{ij}\le A~\forall i\in I,t\in \{1,\ldots,T - A\}$$\right} $$\sum_{j=t+1}^{t+W}y_{ij}\ge {W}\cdot(y_{i(t+1)}-y_{it}\forall i\in I, t\in \{1, \ldots, \mid T \mid - {W}\}$$

$x_{ijt}$ and $y_{it}$ are binary variables. $x_{ijt}$ indicates a shift assignment, $y_{it}$ whether a worker works on a day or not. For this $$\sum_{j\in J} x_{ijt}=y_{it}\forall i\in I, t\in T$$ holds. $I$ is the set of worker, $J$ of the shifts and $T$ the days.

I have this constraint which ensures that there are at least $F$ consecutive days off. F.e. for $F=2$, an 1-0-1 is prevented.

$$1+y_{it}\ge y_{i(t-1)}+y_{ik}~\forall i\in I, t\in\left\{ 2,\ldots,T- {F}+1 \right\}, k\in \left\{ t+1,\ldots,t+{F}-1 \right\}$$

I also have this constraint that ensures a minimum number $A$ of consecutive work days. Is it possible to change my first constraint to a work on, using a summation as in the second constraints?

$$\sum_{j=t}^{t+A}y_{ij}\le A~\forall i\in I,t\in \{1,\ldots,T - A\}$$\right}

$x_{ijt}$ and $y_{it}$ are binary variables. $x_{ijt}$ indicates a shift assignment, $y_{it}$ whether a worker works on a day or not. For this $$\sum_{j\in J} x_{ijt}=y_{it}\forall i\in I, t\in T$$ holds. $I$ is the set of worker, $J$ of the shifts and $T$ the days.

I have this constraint which ensures that there are at least $F$ consecutive days off. F.e. for $F=2$, an 1-0-1 is prevented.

$$1+y_{it}\ge y_{i(t-1)}+y_{ik}~\forall i\in I, t\in\left\{ 2,\ldots,T- {F}+1 \right\}, k\in \left\{ t+1,\ldots,t+{F}-1 \right\}$$

I also have two constraints that ensures a minimum ($W$)/maximum ($A$) number of consecutive work days. Is it possible to change my first constraint to a work on, using a summation as in the second constraints?

$$\sum_{j=t}^{t+A}y_{ij}\le A~\forall i\in I,t\in \{1,\ldots,T - A\}$$ $$\sum_{j=t+1}^{t+W}y_{ij}\ge {W}\cdot(y_{i(t+1)}-y_{it}\forall i\in I, t\in \{1, \ldots, \mid T \mid - {W}\}$$

$x_{ijt}$ and $y_{it}$ are binary variables. $x_{ijt}$ indicates a shift assignment, $y_{it}$ whether a worker works on a day or not. For this $$\sum_{j\in J} x_{ijt}=y_{it}\forall i\in I, t\in T$$ holds. $I$ is the set of worker, $J$ of the shifts and $T$ the days.

added 155 characters in body
Source Link

I have this constraint which ensures that there are at least $F$ consecutive days off. F.e. for $F=2$, an 1-0-1 is prevented.

$$1+y_{it}\ge y_{i(t-1)}+y_{ik}~\forall i\in I, t\in\left\{ 2,\ldots,T- {F}+1 \right\}, k\in \left\{ t+1,\ldots,t+{F}-1 \right\}$$

I also have this constraint that ensures a minimum number $A$ of consecutive work days. Is it possible to change my first constraint to a work on, using a summation as in the second constraints?

$$\sum_{j=t}^{t+A}y_{ij}\le A~\forall i\in I,t\in \{1,\ldots,T - A\}$$\right}

$x$$x_{ijt}$ and $y$$y_{it}$ are binary variables. $x$$x_{ijt}$ indicates a shift assignment, $y$$y_{it}$ whether a worker works on a day or not. For this $$\sum_{j\in J} x_{ijt}=y_{it}\forall i\in I, t\in T$$ holds. $I$ is the set of worker, $J$ of the shifts and $T$ the days.

I have this constraint which ensures that there are at least $F$ consecutive days off. F.e. for $F=2$, an 1-0-1 is prevented.

$$1+y_{it}\ge y_{i(t-1)}+y_{ik}~\forall i\in I, t\in\left\{ 2,\ldots,T- {F}+1 \right\}, k\in \left\{ t+1,\ldots,t+{F}-1 \right\}$$

I also have this constraint that ensures a minimum number $A$ of consecutive work days. Is it possible to change my first constraint to a work on, using a summation as in the second constraints?

$$\sum_{j=t}^{t+A}y_{ij}\le A~\forall i\in I,t\in \{1,\ldots,T - A\}$$\right}

$x$ and $y$ are binary variables. $x$ indicates a shift assignment, $y$ whether a worker works on a day or not.

I have this constraint which ensures that there are at least $F$ consecutive days off. F.e. for $F=2$, an 1-0-1 is prevented.

$$1+y_{it}\ge y_{i(t-1)}+y_{ik}~\forall i\in I, t\in\left\{ 2,\ldots,T- {F}+1 \right\}, k\in \left\{ t+1,\ldots,t+{F}-1 \right\}$$

I also have this constraint that ensures a minimum number $A$ of consecutive work days. Is it possible to change my first constraint to a work on, using a summation as in the second constraints?

$$\sum_{j=t}^{t+A}y_{ij}\le A~\forall i\in I,t\in \{1,\ldots,T - A\}$$\right}

$x_{ijt}$ and $y_{it}$ are binary variables. $x_{ijt}$ indicates a shift assignment, $y_{it}$ whether a worker works on a day or not. For this $$\sum_{j\in J} x_{ijt}=y_{it}\forall i\in I, t\in T$$ holds. $I$ is the set of worker, $J$ of the shifts and $T$ the days.

edited tags
Link
RobPratt
  • 34.3k
  • 2
  • 47
  • 90
added 28 characters in body
Source Link
Loading
Source Link
Loading