Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule
From MaRDI portal
Publication:826091
DOI10.1007/3-540-63397-9_18zbMath1479.90088OpenAlexW1841915551MaRDI QIDQ826091
José Niño-Mora, Kevin D. Glazebrook
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/3-540-63397-9_18
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)
This page was built for publication: Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule
