It’d be great to be able to prioritise a group of services (A) so the they are always completed before another group (B).
It can be done right now (and I’m doing it) by using the current relations system by creating a “in_sequence” between each (A) and every (B), but this gets out of hand extremely quickly.
Eg. 10 A’s and 50 B’s requires ~500 relations.
It seems to completely breakdown at higher service counts, and for smaller counts where it does work, optimization time seems to be >10x.