Optimal allocation of a server between two queues with due times (Q3986808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 29434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal allocation of a server between two queues with due times |
scientific article; zbMATH DE number 29434 |
Statements
Optimal allocation of a server between two queues with due times (English)
0 references
27 June 1992
0 references
queues
0 references
dynamic priority assignment
0 references
stationary optimal preemptive policy
0 references
stochastic dominance
0 references
dynamic programming
0 references
0.8078848123550415
0 references
0.8037416338920593
0 references
0.801965594291687
0 references
0.8015674948692322
0 references
0.7976825833320618
0 references
