Two competing queues with linear costs and geometric service requirements: the <i>μc</i>-rule is often optimal (Q3217401)
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 3883367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two competing queues with linear costs and geometric service requirements: the <i>μc</i>-rule is often optimal |
scientific article; zbMATH DE number 3883367 |
Statements
Two competing queues with linear costs and geometric service requirements: the <i>μc</i>-rule is often optimal (English)
0 references
1985
0 references
dynamic priority assignment problem
0 references
buffer
0 references
optimality
0 references
long-run average criterion
0 references
discounted criterion
0 references
0.9366156458854676
0 references
0.8633865118026733
0 references
0.822256326675415
0 references
0.8151126503944397
0 references
0.8145128488540649
0 references
