I have a problem where there are stations, types and tasks which has to be assigned to each other. Now for me the thing is I want the variable $x$ to be not binary like in assignment problem for example but between $[0,1]$. Now I wanted to add a constraint which says something like that: the tasks are fractional (able to split) yes but there should not be too tiny splits because it is just not good for the implication in the real production process. Therefore I thought of a parameter for example $Z^\min$ which I give a value of e.g. $10$. I need to say that the duration of every $x$-tuple (station, type, task) is larger than at least $10$. So that even there is a split an $x(1,1,1) = 0.5$ so only half of the original task is assigned, there is never an assignment of $x$ which makes the duration smaller than 10. Therefore I have an approach and think it is makes sense but wanted to take other opinions on that. Here the one constraint I talked about and following the complete model:
\begin{align} & \sum_{j=1}^{J} d_{ijk}\cdot x_{ijk} \geq Z^{\min} \cdot x_{ijk} &&\text{$\forall \, i \in I$, $\forall \, k \in K$} \end{align}
\begin{aligned} &\text{min} &&\sum_{i=1}^{I}\sum_{j=1}^{J}\sum_{k=1}^{K} c_{ijk}\cdot x_{ijk} &&+\sum_{i=1}^{I}\sum_{j=1}^{J} f_{ij} \cdot \gamma_{ij} \\ &\text{s.t.} &&\sum_{i=1}^{I}\sum_{j=1}^{J} x_{ijk} &&= 1 &\text{$\forall \, k \in K$} \\ &&&\sum_{j=1}^{J} \gamma_{ij} &&= 1 &\text{$\forall \, i \in I$} \\ &&&\sum_{j=1}^{J}\sum_{k=1}^{K} d_{ijk}\cdot x_{ijk} &&\leq C ^ {\max} \cdot \gamma_{ij} &\text{$\forall \, i \in I$} \\ &&& \sum_{j=1}^{J} d_{ijk}\cdot x_{ijk} &&\geq Z^{\min} \cdot x_{ijk} &\text{$\forall \, i \in I$, $\forall \, k \in K$} \\ &&&\sum_{i=1}^{I} i \cdot x_{ik} && \leq \sum_{i=1}^{I} i \cdot x_{im} &\text{$\forall \, j \in J$} \\ &&& x_{ijk} \in [0,1], && \gamma_{ij} \in \{0,1\} \end{aligned}