Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
From MaRDI portal
Publication:1296607
DOI10.1214/aoap/1028903452zbMath0938.60094OpenAlexW2155770202MaRDI QIDQ1296607
Publication date: 8 June 2000
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1028903452
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy ⋮ Largest weighted delay first scheduling: Large deviations and optimality ⋮ 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. ⋮ On-line service scheduling ⋮ A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit ⋮ Asymptotic optimality of maximum pressure policies in stochastic processing networks ⋮ The capacity of QoE for wireless networks with unreliable transmissions ⋮ Approximate linear programming for networks: average cost bounds ⋮ Correction: Brownian models of open processing networks: canonical representation of workload ⋮ On scheduling a multiclass queue with abandonments under general delay costs ⋮ Asymptotically optimal control of \(N\)-systems with \(H_2^*\) service times under many-server heavy traffic ⋮ A load balancing system in the many-server heavy-traffic asymptotics ⋮ On the Optimal Control of Parallel Processing Networks with Resource Collaboration and Multitasking ⋮ Queueing Network Controls via Deep Reinforcement Learning ⋮ Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources ⋮ Asymptotically tight steady-state queue length bounds implied by drift conditions ⋮ Performance evaluation for general queueing networks in manufacturing systems: characterizing the trade-off between queue time and utilization ⋮ A Fluid-Diffusion-Hybrid Limiting Approximation for Priority Systems with Fast and Slow Customers ⋮ Parallel server systems under an extended heavy traffic condition: a lower bound ⋮ Applications of fluid models in service operations management ⋮ Matched queues with flexible and impatient customers ⋮ Stability analysis of N-model systems under a static priority rule ⋮ Dynamic Volunteer Staffing in Multicrop Gleaning Operations ⋮ An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis ⋮ A broader view of Brownian networks ⋮ A survey on skill-based routing with applications to service operations management ⋮ Large-deviations analysis of the fluid approximation for a controllable tandem queue ⋮ The ``least flexible job first rule in scheduling and in queueing ⋮ MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic ⋮ TWO-CLASS ROUTING WITH ADMISSION CONTROL AND STRICT PRIORITIES ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Adaptive Matching for Expert Systems with Uncertain Task Types ⋮ Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control ⋮ Performance of service policies in a specialized service system with parallel servers ⋮ Optimal control of parallel server systems with many servers in heavy traffic ⋮ THE N-NETWORK MODEL WITH UPGRADES ⋮ Optimal control with monotonicity constraints for a parallel-server loss channel serving multi-class jobs ⋮ Pathwise optimality of the exponential scheduling rule for wireless channels ⋮ Asymptotically optimal parallel resource assignment with interference ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS ⋮ Optimal control of assignment of jobs to processors under heavy traffic ⋮ An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment ⋮ Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime ⋮ On the Control of Fork-Join Networks ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ Optimal control of a flexible server ⋮ Optimal Control of Brownian Inventory Models with Convex Holding Cost: Average Cost Case ⋮ A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic ⋮ Partial Flexibility in Routeing and Scheduling ⋮ Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling ⋮ Dynamic routing in large-scale service systems with heterogeneous servers ⋮ On the Optimal Design of a Bipartite Matching Queueing System
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- A network of priority queues in heavy traffic: One bottleneck station
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Open Queueing Networks in Heavy Traffic
- The supremum distribution of a Lévy process with no negative jumps
- A Basic Dynamic Routing Problem and Diffusion
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
