Approximations for Markovian multi-class queues with preemptive priorities

Matthijs C. van der Heijden, Aart van Harten, Andrei Sleptchenko

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)
18 Downloads (Pure)


We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach yields small-to-moderate approximation errors.
Original languageUndefined
Pages (from-to)273-282
Number of pages10
JournalOperations research letters
Issue number3
Publication statusPublished - 2004


  • Multi-channel queues
  • IR-75710
  • Preemptive priorities
  • METIS-207194
  • Approximations

Cite this