Approximations for Markovian multi-class queues with preemptive priorities

Matthieu Van der Heijden, Aart Van Harten, Andrei Sleptchenko

    Research output: Contribution to journalArticlepeer-review

    18 Scopus citations

    Abstract

    The approximations study of performance measures in multi-class queues was presented. The Markovian multi-class queues under study were with preemptive priorities. The queues approximations for large problems were based on class aggregation and server reduction techniques. The obtained approximations were compared with the simulation results to their exactness for yielding small-to-moderate approximation errors.

    Original languageBritish English
    Pages (from-to)273-282
    Number of pages10
    JournalOperations Research Letters
    Volume32
    Issue number3
    DOIs
    StatePublished - May 2004

    Keywords

    • Approximations
    • Multi-channel queues
    • Preemptive priorities

    Fingerprint

    Dive into the research topics of 'Approximations for Markovian multi-class queues with preemptive priorities'. Together they form a unique fingerprint.

    Cite this