Optimality of the round-robin routing policy. (English) Zbl 0804.60080
Summary: 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.
MSC:
60K25 | Queueing theory (aspects of probability theory) |
49K30 | Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) |
49N30 | Problems with incomplete information (optimization) |
68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |
90B22 | Queues and service in operations research |
90B80 | Discrete location and assignment |