When a technician has multiple visits spread across several locations, there are cases where those visits need to be handled as a block — no intermediate visits from other clients in between.

Today, this can be approximated using visit dependencies with maxDelay, but that forces an upfront decision on both the sequence and the expected delay between visits. In practice this is hard to configure correctly: set maxDelay too tight and valid solutions get rejected, too loose and unrelated visits slip in between.

What we need is a way to define a named group of visits that must be scheduled consecutively, without any visits outside the group in between — similar to how PDR handles multi-stop jobs with prohibited pooling. The optimizer should be free to determine the best sequence within the group, without requiring us to hardcode that order in advance.