Optimal Service Policy for the M/G/1 Queue with Multiple Classes of Arrivals.
RAND CORP SANTA MONICA CALIF
Pagination or Media Count:
Consider an MG1 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 1mu 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 Csub imusub i among those present. Author
- Operations Research