TY - JOUR
T1 - Periodic routing to parallel queues and billiard sequences
AU - Hordijk, A.
AU - van der Laan, D.A.
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/21144454001
UR - https://www.scopus.com/inward/citedby.url?scp=21144454001&partnerID=8YFLogxK
U2 - 10.1007/s001860300322
DO - 10.1007/s001860300322
M3 - Article
SN - 1432-2994
VL - 59
SP - 173
EP - 192
JO - Mathematical Methods of Operations Research
JF - Mathematical Methods of Operations Research
IS - 2
ER -
