When Does Cμ Rule Apply to Finite-Population Queuing Systems
Operations Research Letters Volume 33, Issue 3, May 2005, Pages 301–304
Posted: 2 Jul 2013
Date Written: June 1, 2004
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: Optimal scheduling, Priority assignment, Finite-source queue, Machine repairman problem, cμ rule, Preemption
Suggested Citation: Suggested Citation