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

14 Citations (Scopus)

Abstract

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
Volume32
Issue number3
DOIs
Publication statusPublished - 2004

Keywords

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

Cite this

van der Heijden, Matthijs C. ; van Harten, Aart ; Sleptchenko, Andrei. / Approximations for Markovian multi-class queues with preemptive priorities. In: Operations research letters. 2004 ; Vol. 32, No. 3. pp. 273-282.
@article{8a23ae66a15346e4af813efa25a35842,
title = "Approximations for Markovian multi-class queues with preemptive priorities",
abstract = "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.",
keywords = "Multi-channel queues, IR-75710, Preemptive priorities, METIS-207194, Approximations",
author = "{van der Heijden}, {Matthijs C.} and {van Harten}, Aart and Andrei Sleptchenko",
year = "2004",
doi = "10.1016/j.orl.2003.09.001",
language = "Undefined",
volume = "32",
pages = "273--282",
journal = "Operations research letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "3",

}

Approximations for Markovian multi-class queues with preemptive priorities. / van der Heijden, Matthijs C.; van Harten, Aart; Sleptchenko, Andrei.

In: Operations research letters, Vol. 32, No. 3, 2004, p. 273-282.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Approximations for Markovian multi-class queues with preemptive priorities

AU - van der Heijden, Matthijs C.

AU - van Harten, Aart

AU - Sleptchenko, Andrei

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Multi-channel queues

KW - IR-75710

KW - Preemptive priorities

KW - METIS-207194

KW - Approximations

U2 - 10.1016/j.orl.2003.09.001

DO - 10.1016/j.orl.2003.09.001

M3 - Article

VL - 32

SP - 273

EP - 282

JO - Operations research letters

JF - Operations research letters

SN - 0167-6377

IS - 3

ER -