Optimal server scheduling in nonpreemptive finite-population queueing systems

Authors:
Seyed M. Iravani;Vijayalakshmi Krishnamurthy;Gary H. Chao
Affiliations:
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, USA 60208;Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, USA 60208;Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, USA 60208
Venue:
Queueing Systems: Theory and Applications
Year:
2007

Citing 2
Cited 1

Workforce Agility in Repair and Maintenance Environments

Manufacturing & Service Operations Management
When does the cµ rule apply to finite-population queueing systems?

Operations Research Letters

Scheduling a dynamic aircraft repair shop with limited repair resources

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a finite-population queueing system with heterogeneous classes of customers and a single server. For the case of nonpreemptive service, we fully characterize the structure of the server's optimal service policy that minimizes the total average customer waiting costs. We show that the optimal service policy may never serve some classes of customers. For those classes that are served, we show that the optimal service policy is a simple static priority policy. We also derive sufficient conditions that determine the optimal priority sequence.