Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
From MaRDI portal
Publication:1872498
DOI10.1214/aoap/1019487513zbMath1083.60520OpenAlexW2092828913MaRDI QIDQ1872498
Publication date: 6 May 2003
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aoap/1019487513
Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36)
Related Items
Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments ⋮ Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ Fluid analysis of an input control problem ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ Optimal dividend and capital injection strategies in the Cramér-Lundberg risk model ⋮ Queueing Network Controls via Deep Reinforcement Learning ⋮ Applications of fluid models in service operations management ⋮ Joint routing and scheduling control in a two-class network with a flexible server ⋮ An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality ⋮ Large-deviations analysis of the fluid approximation for a controllable tandem queue ⋮ Asymptotic Fluid Optimality and Efficiency of the Tracking Policy for Bandwidth-Sharing Networks ⋮ On the accuracy of fluid approximations to a class of inventory-level-dependent EOQ and EPQ models ⋮ Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control ⋮ Asymptotically optimal parallel resource assignment with interference ⋮ Exponential penalty function control of loss networks ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment ⋮ Approximation of Optimal Reinsurance and Dividend Payout Policies ⋮ Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability of two families of queueing networks and a discussion of fluid limits
- A critically loaded multirate link with trunk reservation
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Value iteration and optimization of multiclass queueing networks
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
- An algorithm for minimum wait draining of two-station fluid re-entrant line
- Ergodicity of stochastic processes describing the operation of open queueing networks
- Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems
- Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- An Algorithm for a Class of Continuous Linear Programs
- Dynamic Scheduling of a Multiclass Fluid Network
- Optimal Control of a Multiclass, Flexible Queueing System
- Heavy Traffic Analysis of a Controlled Multiclass Queueing Network via Weak Convergence Methods
- Stability and convergence of moments for multiclass queueing networks via fluid limit models
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- Optimal anticipative scheduling with asynchronous transmission opportunities
- Branching bandits and Klimov's problem: achievable region and side constraints
- Stability and Instability of Fluid Models for Reentrant Lines
- A Duality Theory for Separated Continuous Linear Programs
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Scheduling and stability aspects of a general class of parallel processing systems
