When does the cµ rule apply to finite-population queueing systems?

Authors:
Seyed M. R. Iravani;Bora Kolfal
Affiliations:
Department of Industrial Engineering and Management Sciences, Northwestern University, 2145 Sheridan Road, C210 Tech., Evanston, IL 60208-3118, USA;Department of Industrial Engineering and Management Sciences, Northwestern University, 2145 Sheridan Road, C210 Tech., Evanston, IL 60208-3118, USA
Venue:
Operations Research Letters
Year:
2005

Citing 2
Cited 4

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

Optimal server scheduling in nonpreemptive finite-population queueing systems

Queueing Systems: Theory and Applications
Optimal selection of the service rate for a finite input source fuzzy queuing system

Fuzzy Sets and Systems
On the optimal control of a two-queue polling model

Operations Research Letters
When does the cµ rule apply to finite-population queueing systems?

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider optimal scheduling of the server in a finite-population queueing system with multiple classes of customers, when preemption is allowed. A customer of class i has arrival rate @l"i, service rate @m"i, and holding cost c"i per unit time. We derive conditions under which the c@m rule is optimal.