Approximations for Markovian multi-class queues with preemptive priorities

M.C. Heijden, van der; A. Harten, van; A.V. Sleptchenko

doi:10.1016/j.orl.2003.09.001

Approximations for Markovian multi-class queues with preemptive priorities

M.C. Heijden, van der, A. Harten, van, A.V. Sleptchenko

Eurandom

Research output: Contribution to journal › Article › Academic › peer-review

18 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 language	English
Pages (from-to)	273-282
Journal	Operations Research Letters
Volume	32
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2003.09.001
Publication status	Published - 2004

Access to Document

10.1016/j.orl.2003.09.001

Cite this

@article{510dae7721054bbab250f8d11faffade,

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.",

author = "{Heijden, van der}, M.C. and {Harten, van}, A. and A.V. Sleptchenko",

year = "2004",

doi = "10.1016/j.orl.2003.09.001",

language = "English",

volume = "32",

pages = "273--282",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

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

AU - Heijden, van der, M.C.

AU - Harten, van, A.

AU - Sleptchenko, A.V.

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.

U2 - 10.1016/j.orl.2003.09.001

DO - 10.1016/j.orl.2003.09.001

M3 - Article

SN - 0167-6377

VL - 32

SP - 273

EP - 282

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

Approximations for Markovian multi-class queues with preemptive priorities

Abstract

Access to Document

Fingerprint

Cite this