Two competing queues with linear costs and geometric service requirements: the <i>μc</i>-rule is often optimal (Q3217401)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two competing queues with linear costs and geometric service requirements: the <i>μc</i>-rule is often optimal |
scientific article |
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