The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
From MaRDI portal
Publication:1923638
DOI10.1007/BF01149167zbMath0857.60093OpenAlexW2016798673MaRDI QIDQ1923638
Publication date: 3 March 1997
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01149167
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Invariance of workload in queueing systems, Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule, Mathematical methods to study the polling systems, Bounds on linear PDEs via semidefinite optimization, Applications of semidefinite programming, QRF
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dominance relations in polling systems
- Loss networks
- Performance bounds for scheduling queueing networks
- On the Gittins index for multiarmed bandits
- Multiple feedback at a single-server station
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- A short proof of the Gittins index theorem
- Rounding algorithms for covering problems
- Structure of a simple scheduling polyhedron
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Dynamic Scheduling of a Two-Class Queue with Setups
- Branching Bandit Processes
- Extensions of the multiarmed bandit problem: The discounted case
- A lemma on the multiarmed bandit problem
- Sensitivity Analysis for Stochastic Scheduling Problems
- Queuing analysis of polling models
- M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
- The Analysis of Random Polling Systems
- Optimal dynamic scheduling in Jackson networks
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Priority Queue with Discounted Linear Costs
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Stochastic scheduling with order constraints
- Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
- Time-Sharing Service Systems. I
- Dynamic Scheduling of a Multiclass Fluid Network
- Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
- Performance bounds for queueing networks and scheduling policies
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- On the Optimal Control of Two Queues with Server Setup Times and Its Analysis
- Branching bandits and Klimov's problem: achievable region and side constraints
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Scheduling with Random Service Times
