On Markovian multi-class, multi-server queueing
From MaRDI portal
Publication:1810752
DOI10.1023/A:1023209813523zbMath1020.60090OpenAlexW1559791216MaRDI QIDQ1810752
Andrei Sleptchenko, Aart van Harten
Publication date: 9 June 2003
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023209813523
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (9)
The impact of a global FCFS service discipline in a two-class queue with dedicated servers ⋮ Upper bounds on performance measures of heterogeneous \(M/M/c\) queues ⋮ Approximations for Markovian multi-class queues with preemptive priorities. ⋮ Using repair priorities to reduce stock investment in spare part networks ⋮ An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking ⋮ A sorting based efficient heuristic for pooled repair shop designs ⋮ REDUCING COSTS OF SPARE PARTS SUPPLY SYSTEMS VIA STATIC PRIORITIES ⋮ An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities ⋮ WCFS: a new framework for analyzing multiserver systems
This page was built for publication: On Markovian multi-class, multi-server queueing
