Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem (Q2956540)
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: Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem |
scientific article; zbMATH DE number 6675983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem |
scientific article; zbMATH DE number 6675983 |
Statements
18 January 2017
0 references
stochastic networks
0 references
parallel server systems
0 references
dynamic control
0 references
resource pooling
0 references
heavy traffic
0 references
Brownian control problems
0 references
state space collapse
0 references
threshold policies
0 references
Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem (English)
0 references
0.8856382
0 references
0.88193005
0 references
0.88003623
0 references
0.87073296
0 references
0.8698199
0 references
0.86814296
0 references
0.85722053
0 references
0 references
