When random-order-of-service outperforms first-come-first-served (Q1785418)
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: When random-order-of-service outperforms first-come-first-served |
scientific article; zbMATH DE number 6945399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When random-order-of-service outperforms first-come-first-served |
scientific article; zbMATH DE number 6945399 |
Statements
When random-order-of-service outperforms first-come-first-served (English)
0 references
28 September 2018
0 references
scheduling policies
0 references
Markov-modulated Poisson process
0 references
first-come-first-served
0 references
random-order-of-service
0 references
