J
Jake B.
Hoping to get some thoughts on a dispatch algorithm.
Here is the problem:
There is a finite set of reservation counters, for e.g (R1, R2, R3,
R4)
People who've lined up in a queue as P1,P2,P3,p4,P1,P2...Pn need to be
dispatched to one of these counters.
Rule is once they've been dispatched to a reservation counter, they
will have to go the same counter going fwd.
So in a queue based order, if following is the (infinite)sequence -
P1,P4,P5,P1,P3,P2,P1,P1,P8
(note multiple occurances of p1) Supposing P1 is dispatched to counter
R1, for every occurance
of P1 in the sequence needs to be dispatched always to R1.
Thoughts anybody?
TIA, Jake
Here is the problem:
There is a finite set of reservation counters, for e.g (R1, R2, R3,
R4)
People who've lined up in a queue as P1,P2,P3,p4,P1,P2...Pn need to be
dispatched to one of these counters.
Rule is once they've been dispatched to a reservation counter, they
will have to go the same counter going fwd.
So in a queue based order, if following is the (infinite)sequence -
P1,P4,P5,P1,P3,P2,P1,P1,P8
(note multiple occurances of p1) Supposing P1 is dispatched to counter
R1, for every occurance
of P1 in the sequence needs to be dispatched always to R1.
Thoughts anybody?
TIA, Jake