On the optimal allocation of customers that must depart in sequence

Authors:
Joy Kuri;Anurag Kumar
Affiliations:
Department of Electrical Communications Engineering, Indian Institute of Science, Bangalore-560012, India;Department of Electrical Communications Engineering, Indian Institute of Science, Bangalore-560012, India
Venue:
Operations Research Letters
Year:
1994

Citing 2
Cited 1

Computer networks

Computer networks
Broadband ISDN and asynchronous transfer mode (ATM)

IEEE Communications Magazine

Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.