Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies (Q1296607)
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 1319834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies |
scientific article; zbMATH DE number 1319834 |
Statements
Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies (English)
0 references
8 June 2000
0 references
The paper deals with dynamic scheduling in a queueing system M/2/D/2 with linear holding costs. A discrete-review control policy is constructed and its asymptotical optimality in the heavy traffic is proved. A main tool for the above discussion is the so-called BIGSTEP method.
0 references
BIGSTEP method
0 references
resource pooling
0 references
heavy traffic
0 references
0 references
0 references
0 references
0.9022505
0 references
0.88866603
0 references
0 references
0.8877574
0 references
0.8863747
0 references
0 references
