The unbalance and bounds on the average waiting time for periodic routing to one queue

In this paper we introduce the combinatorial notion of unbalance for a periodic zero-one splitting sequence. Using this unbalance we derive an upper bound for the average expected waiting time of jobs which are routed to one queue according to a periodic zero-one splitting sequence. In the companion paper [16] the upper bound will be extended to the routing to N parallel queues. Copyright Springer-Verlag 2004

MoreLess

Year of publication:	2004
Authors:	Hordijk, Arie ; Laan, Dinard van der
Published in:	Computational Statistics. - Springer. - Vol. 59.2004, 1, p. 1-23
Publisher:	Springer
Subject:	Generalized round robin routing \| Periodic sequence \| Unbalance \| Graph order

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010847948