On the optimal allocation of customers that must depart in sequence

On the optimal allocation of customers that must depart in sequence

0.00 Avg rating—0 Votes
Article ID: iaor19951520
Country: Netherlands
Volume: 15
Issue: 1
Start Page Number: 41
End Page Number: 46
Publication Date: Feb 1994
Journal: Operations Research Letters
Authors: ,
Abstract:

The authors 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, the authors show that the round-robin allocation policy is optimal in a sample path sense.

Reviews

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