Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule (Q475118)
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 6373793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule |
scientific article; zbMATH DE number 6373793 |
Statements
Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule (English)
0 references
25 November 2014
0 references
\(c\mu\)-rule
0 references
dynamic scheduling
0 references
stochastic optimization
0 references
Lyapunov drift analysis
0 references
strong conservation law
0 references
achievable region method
0 references
multi-class queueing systems
0 references
polymatroid optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8742143
0 references
0.8661549
0 references
0 references
0.85173947
0 references
0.84989965
0 references
0.8478708
0 references
