Let's say you have a network path with a dozen network nodes, and a workstation at each node. These workstations are tended by two human transporters who's are dispatched (by a dispatcher) to go hither and yon along the network path, back and forth as needed, to the next workstation that is ready to move an item from an exit transfer, to a processor. Items "to be moved" arrive at the 12 stations at various times. By default, operators/transporters work their way through a FIFO task sequence list. Which means they often skip over 1 or more "ready" stations that had items appear AFTER the task they are currently walking to - which is inefficient because they are ignoring work that could readily be done "as long as they are there". Real humans on the other hand, would be more inclined to stop spontaneously to move the item (or items) as they are walking by - rather than blindly going to their original task sequence destination because it is the next one on the FIFO list. Essentially, need a way to make the operator/transporter smart enough to know that they are walking by a workstation that is ready to have work performed, then do that work in it's entirety, then proceed to the original destination task sequence. Something tells me this would involve a sort of intelligent, dynamic "reprioritize-on-the-fly" dispatching feature that would continuously be on the lookout for any possible work that could be done by the operator/transporter "as long as I'm here", and thus re-organize the task list accordingly, to accomodate "doing it as long as I'm here". There are physical distance operator/transporter items on picklists, but they don't seem to be quite what I'm looking for. This is kind of like a milk run scenario, but actually more like a "chessmaster" walking around a long table attending to a dozen chess games at once, possibly stopping to make a chess move for someone who's physically nearby and ready, then, continuing on to the very end of the table for the next person who was originally ready for a chess move.
