When Does Cμ Rule Apply to Finite-Population Queuing Systems

Operations Research Letters Volume 33, Issue 3, May 2005, Pages 301–304

University of Alberta School of Business Research Paper No. 2013-1048

Posted: 2 Jul 2013

See all articles by Seyed Iravani

Seyed Iravani

Northwestern University - Department of Industrial Engineering and Management Sciences

Bora Kolfal

University of Alberta - Department of Accounting, Operations & Information Systems

Date Written: June 1, 2004

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: Optimal scheduling, Priority assignment, Finite-source queue, Machine repairman problem, cμ rule, Preemption

Suggested Citation

Iravani, Seyed and Kolfal, Bora, When Does Cμ Rule Apply to Finite-Population Queuing Systems (June 1, 2004). Operations Research Letters Volume 33, Issue 3, May 2005, Pages 301–304, University of Alberta School of Business Research Paper No. 2013-1048, Available at SSRN: https://ssrn.com/abstract=2279605

Seyed Iravani (Contact Author)

Northwestern University - Department of Industrial Engineering and Management Sciences ( email )

Evanston, IL 60208-3119
United States

Bora Kolfal

University of Alberta - Department of Accounting, Operations & Information Systems ( email )

Edmonton, Alberta T6G 2R6
Canada

Here is the Coronavirus
related research on SSRN

Paper statistics

Abstract Views
261
PlumX Metrics