Article ID Journal Published Year Pages File Type
10524107 Operations Research Letters 2005 4 Pages PDF
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 λi, service rate μi, and holding cost ci per unit time. We derive conditions under which the cμ rule is optimal.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
When does the cμ rule apply to finite-population queueing systems?
Authors
, ,