Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
From MaRDI portal
Publication:1774223
DOI10.1214/105051604000000495zbMath1071.60081arXivmath/0503477OpenAlexW1972400284WikidataQ113427650 ScholiaQ113427650MaRDI QIDQ1774223
Publication date: 29 April 2005
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503477
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (34)
Stationarity and control of a tandem fluid network with fractional Brownian motion input ⋮ Asymptotic optimality of maximum pressure policies in stochastic processing networks ⋮ On the asymptotic optimality of the \(c\mu\)-rule in queueing networks ⋮ On scheduling a multiclass queue with abandonments under general delay costs ⋮ An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic ⋮ Optimal Control of a Time-Varying Double-Ended Production Queueing Model ⋮ Queueing Network Controls via Deep Reinforcement Learning ⋮ Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources ⋮ Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic ⋮ Asymptotically optimal control of many-server heterogeneous service systems with \(H_{2}^{*}\) service times ⋮ Unnamed Item ⋮ Congestion-based leadtime quotation and pricing for revenue maximization with heterogeneous customers ⋮ Simple form control policies for resource sharing networks with HGI performance ⋮ Controlled stochastic networks in heavy traffic: convergence of value functions ⋮ Dynamic Matching for Real-Time Ride Sharing ⋮ Dynamic Volunteer Staffing in Multicrop Gleaning Operations ⋮ Process Flexibility for Multiperiod Production Systems ⋮ An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis ⋮ Optimal control of parallel server systems with many servers in heavy traffic ⋮ Asymptotically optimal parallel resource assignment with interference ⋮ Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic ⋮ Convergence of a queueing system in heavy traffic with general patience-time distributions ⋮ An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment ⋮ Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function ⋮ Heavy Traffic Analysis of a Simple Closed-Loop Supply Chain ⋮ Optimal control of a high-volume assemble-to-order system with maximum leadtime quotation and expediting ⋮ On the Control of Fork-Join Networks ⋮ Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ Complete resource pooling of a load-balancing policy for a network of battery swapping stations ⋮ Instability of FIFO in a simple queueing system with arbitrarily low loads ⋮ Matching While Learning ⋮ Optimal Control of Brownian Inventory Models with Convex Holding Cost: Average Cost Case ⋮ Ranking flexibility structures in queueing systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An invariance principle for semimartingale reflecting Brownian motions in an orthant
- Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
- State space collapse with application to heavy traffic limits for multiclass queueing networks
- 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 control of Brownian networks: State space collapse and equivalent workload formulations
- Two workload properties for Brownian networks
- A broader view of Brownian networks
- Brownian models of open processing networks: Canonical representation of workload.
- 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
- Continuous-review tracking policies for dynamic control of stochastic networks
- Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality.
- Heavy traffic limits for some queueing networks
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Heavy traffic resource pooling in parallel-server systems
- Stochastic-Process Limits
- Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic
- Brownian Networks with Discretionary Routing
- Heavy Traffic Convergence of a Controlled, Multiclass Queueing System
- Resource pooling in queueing networks with dynamic routing
- Dynamic Scheduling of a Multiclass Make-to-Stock Queue
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
- Limit theorems for pathwise average cost per unit time problems for controlled queues in heavy traffic
- Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
- Heavy Traffic Analysis of a Controlled Multiclass Queueing Network via Weak Convergence Methods
- Optimal control of assignment of jobs to processors under heavy traffic
- 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
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums
- Routing and Singular Control for Queueing Networks in Heavy Traffic
- A multiclass queue in heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls
This page was built for publication: Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
