Accession Number : AD0738356

Title :   Optimal Service Policy for the M/G/1 Queue with Multiple Classes of Arrivals.

Descriptive Note : Preliminary paper,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Kakalik,James S. ; Little,John D. C.

Report Date : SEP 1971

Pagination or Media Count : 22

Abstract : Consider an M/G/1 queue with multiple classes of customers, nonpreemptive service, and a cost of waiting. Suppose that the server can select next any customer present or can remain idle; and that this decision can be made as a function of the complete state of the system, i.e., the number of each class of customer present. The objective is to minimize the stationary expected cost rate. Let 1/mu sub i be the mean service time and C sub i be the waiting cost per unit time for class i customers. The optimal policy is shnown to be: Never hold the server idle when customers are present; and serve next a customer with the largest value of C(sub i)mu(sub i) among those present. (Author)

Descriptors :   (*QUEUEING THEORY, OPTIMIZATION), STOCHASTIC PROCESSES, LINEAR PROGRAMMING, DECISION THEORY, SET THEORY

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE