Open gausie opened 7 years ago
Basically this needs to be a sort of lax ALTMULT that will schedule a set of tasks to the same resource unless that constraint makes no solution possible.
Did you ever implement a solution for this? I'm encountering the exact same issue I'd like to resolve.
sorry for the late answer: This is currently not possible, you either have to use the same resource or any assignment is allowed. There is the idea to make any constraint "soft" with some cost, but that would be quite some effort.
One way to deal with this problem is to use a small heuristic on top: iteratively add more constraints until no more solution is found. This of course requires that you have some natural order of your constraints (in this case same resource requirements), but maybe there is some natural hierarchy which ones are more important than other ones?
Hi there!
In the example we have
Is it possible to say that the same resource should manage related tasks but only where possible (i.e. make this a little more lax).
For example. Alice would ideally postprocess the bike she also painted but is willing to postprocess the bike that Bob painted if necessary.