Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
DOI10.1007/s11134-013-9377-3zbMath1299.90103OpenAlexW1981627827MaRDI QIDQ475118
Chih-Ping Li, Michael J. Neely
Publication date: 25 November 2014
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-013-9377-3
stochastic optimizationdynamic schedulingmulti-class queueing systems\(c\mu\)-ruleachievable region methodLyapunov drift analysispolymatroid optimizationstrong conservation law
Convex programming (90C25) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels
- Whittle's index policy for a multi-class queueing system with convex holding costs
- Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Stochastic Network Optimization with Application to Communication and Queueing Systems
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- The cμ rule revisited
- Speed scaling to manage energy and temperature
- Dynamic Control of a Queue with Adjustable Service Rate
- Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
- M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
- Optimal dynamic scheduling in Jackson networks
- Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- Dynamic server allocation to parallel queues with randomly varying connectivity
- Problems of Adaptive Optimization In Multiclass M/GI/1 Queues with Bernoulli Feedback
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Analysis and Synthesis of Computer Systems
This page was built for publication: Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
