Optimality of the round-robin routing policy
1994 ◽
Vol 31
(02)
◽
pp. 466-475
◽
Keyword(s):
In this paper we consider the problem of routing customers to identical servers, each with its own infinite-capacity queue. Under the assumptions that (i) the service times form a sequence of independent and identically distributed random variables with increasing failure rate distribution and (ii) state information is not available, we establish that the round-robin policy minimizes, in the sense of a separable increasing convex ordering, the customer response times and the numbers of customers in the queues.
1992 ◽
Vol 24
(04)
◽
pp. 960-985
◽
1985 ◽
Vol 22
(01)
◽
pp. 197-204
◽
Keyword(s):
1993 ◽
Vol 30
(03)
◽
pp. 703-715
◽
Keyword(s):
1991 ◽
Vol 28
(03)
◽
pp. 709-714
◽
1997 ◽
Vol 11
(1)
◽
pp. 43-48
Keyword(s):