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

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

0.00 Avg rating0 Votes
Article ID: iaor20051168
Country: Germany
Volume: 59
Issue: 1
Start Page Number: 1
End Page Number: 23
Publication Date: Jan 2004
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

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 the upper bound will be extended to the routing to N parallel queues.

Reviews

Required fields are marked *. Your email address will not be published.