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

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.