Hi — thanks for the tips so far. I reorganized the model as follows and I still need help implementing the exact operator behaviour I want:
Current setup
Two separate Sources feed into two distinct Queues (Source1 → QueueA, Source2 → QueueB).
All Operators pull from the Queues (not directly from Sources) and now all 8 operators work simultaneously — good progress there.
What I want
I want Operators to randomly pick/receive tasks (i.e. be assigned items) in a distributed/random manner, and then — after each delivery — each Operator should go to the nearest Source’s Queue (nearest by travel distance) and pick the next box from that Queue.
In short: random assignment/distribution of work, then return-to-nearest-queue logic for subsequent pickups.
Problems / questions
Right now Operators are pulling from Queues and stay busy, but I can’t get them to follow the flow “random assignment → travel to nearest Source’s Queue → pick box”. How can I implement that sequence reliably?
Should I handle the “random distribution” at creation time (round-robin / alternating creation between Sources / set an attribute) or via the Dispatcher/TaskSequence logic? Which approach avoids creating 1000 task sequences at top-level?
Recommended implementation pattern: Process Flow token for “on unload → find nearest source queue → travel there” vs. scripting on the Operator’s UnloadComplete trigger — which is better/scalable?
If you have a small snippet (Process Flow or code) that: (a) assigns incoming items randomly among operators, and (b) on task completion computes nearest Source/Queue and makes the operator travel there — that would be ideal.
Thanks — concrete examples or a tiny model snippet would save me a lot of trial-and-error.