Abstract
In this companion paper of [10] we introduce the combinatorial notion of unbalance for a routing pattern. Using this unbalance we derive an upper bound for the total average expected waiting time of jobs which are routed to parallel queues according to a periodic routing rule. A billiard sequence is obtained with unbalance smaller than or equal to [InlineMediaObject not available: see fulltext.]-1, where N is the number of different symbols in the sequence which corresponds to the number of parallel queues in the routing problem. © Springer-Verlag 2004.
Original language | English |
---|---|
Pages (from-to) | 173-192 |
Number of pages | 19 |
Journal | Mathematical Methods of Operations Research |
Volume | 59 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2004 |