Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule (Q826091)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule |
scientific article; zbMATH DE number 7449695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule |
scientific article; zbMATH DE number 7449695 |
Statements
Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule (English)
0 references
20 December 2021
0 references
0.9315202236175536
0 references
0.8534417152404785
0 references
0.8335088491439819
0 references
0.8100239038467407
0 references
0.8055654168128967
0 references
