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. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1016/j.orl.2003.09.001 | Oper. Res. Lett. |
Keywords | Field | DocType |
approximations,class aggregation,approach yield,approximation error,markovian multi-class queue,simulation result,preemptive priority,performance measure,k queue,multi-channel queues,large problem instance,preemptive priorities,server reduction,multi-class m | Mathematical optimization,Markov process,Computer science,Server,Queue | Journal |
Volume | Issue | ISSN |
32 | 3 | Operations Research Letters |
Citations | PageRank | References |
7 | 0.64 | 6 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Matthieu Van Heijden | 1 | 82 | 8.36 |
Aart Van Harten | 2 | 100 | 7.93 |
Andrei Sleptchenko | 3 | 83 | 10.64 |