On the asymptotic optimality of the \(c\mu\)-rule in queueing networks
From MaRDI portal
Publication:2157890
DOI10.1016/J.ORL.2022.02.002OpenAlexW4212812565MaRDI QIDQ2157890
Publication date: 22 July 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.02.002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost
- Brownian models of feedforward queueing networks: Quasireversibility and product form solutions
- An invariance principle for semimartingale reflecting Brownian motions in an orthant
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Strong approximations for multiclass feedforward queueing networks.
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
- Stochastic-Process Limits
- 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
- The cμ/θ Rule for Many-Server Queues with Abandonment
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
- Control of Patient Flow in Emergency Departments, or Multiclass Queues with Deadlines and Feedback
- On the Control of Fork-Join Networks
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
This page was built for publication: On the asymptotic optimality of the \(c\mu\)-rule in queueing networks
