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

Seyed MR Iravani*, Bora Kolfal

*Corresponding author for this work

Research output: Contribution to journalArticle

12 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)301-304
Number of pages4
JournalOperations Research Letters
Volume33
Issue number3
DOIs
StatePublished - May 1 2005

Keywords

  • Finite-source queue
  • Machine repairman problem; cμ rule; preemption
  • Optimal scheduling
  • Priority assignment

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modeling and Simulation

Fingerprint Dive into the research topics of 'When does the cμ rule apply to finite-population queueing systems?'. Together they form a unique fingerprint.

  • Cite this