Stationary analysis of the ``shortest queue first'' service policy: the asymmetric case (Q4976518)
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: Stationary analysis of the ``shortest queue first service policy: the asymmetric case |
scientific article; zbMATH DE number 6754938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stationary analysis of the ``shortest queue first'' service policy: the asymmetric case |
scientific article; zbMATH DE number 6754938 |
Statements
Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case (English)
0 references
31 July 2017
0 references
queueing
0 references
stochastic scheduling
0 references
Markov processes
0 references
performance evaluation
0 references
functional equations
0 references
0 references
0 references
0.9393810033798218
0 references
0.832221508026123
0 references
0.8239887952804565
0 references
0.8103252053260803
0 references
0.8103252053260803
0 references
