On the optimal allocation of customers that must depart in sequence

Kuri, Joy ; Kumar, Anurag (1994) On the optimal allocation of customers that must depart in sequence Operations Research Letters, 15 (1). pp. 41-46. ISSN 0167-6377

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/0...

Related URL: http://dx.doi.org/10.1016/0167-6377(94)90012-4

Abstract

We address the problem of optimally allocating a stream of arriving customers to a system of n queues, each with its own server. The additional feature of the system is that customers must depart in sequence. For a completely general customer arrival process and deterministic customer service times, we show that the round-robin allocation policy is optimal in a sample path sense.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
Keywords:Queues with Resequencing; Round-robin Scheduling; Optimal Scheduling
ID Code:60689
Deposited On:10 Sep 2011 11:49
Last Modified:10 Sep 2011 11:49

Repository Staff Only: item control page