Beyond the cμ rule: Dynamic scheduling of a two-class loss queue

Eungab Kim, Mark P. Van Oyen

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


We consider scheduling a single server in a two-class M/M/1 queueing system with finite buffers subject to holding costs and rejection costs for rejected jobs. We use dynamic programming to investigate the structural properties of optimal policies. Provided that the delay of serving a job is always less costly than rejecting an arrival, we show that the optimal policy has a monotonic threshold type of switching curve; otherwise, numerical analysis indicates that the threshold structure may not be optimal.

Original languageEnglish
Pages (from-to)17-36
Number of pages20
JournalMathematical Methods of Operations Research
Issue number1
StatePublished - 1998


  • Cμ rule
  • Finite buffer
  • Loss penalty
  • Polling system
  • Stochastic scheduling
  • Threshold policy


Dive into the research topics of 'Beyond the cμ rule: Dynamic scheduling of a two-class loss queue'. Together they form a unique fingerprint.

Cite this