scientific article; zbMATH DE number 6429283
From MaRDI portal
Publication:5247116
DOI10.1214/13-SSY097zbMath1327.60177MaRDI QIDQ5247116
Publication date: 23 April 2015
Full work available at URL: https://projecteuclid.org/euclid.ssy/1427462423
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Optimal stochastic control (93E20) Functional limit theorems; invariance principles (60F17) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items (26)
A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards ⋮ Queueing Dynamics and State Space Collapse in Fragmented Limit Order Book Markets ⋮ Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services ⋮ A service system with on-demand agent invitations ⋮ Double-ended queues with non-Poisson inputs and their effective algorithms ⋮ Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities ⋮ Fluid and diffusion approximations of probabilistic matching systems ⋮ Optimal Control of a Time-Varying Double-Ended Production Queueing Model ⋮ A general stochastic matching model on multigraphs ⋮ Dynamic Stochastic Matching Under Limited Time ⋮ On the instability of matching queues ⋮ Dynamic Matching for Real-Time Ride Sharing ⋮ On Matching and Thickness in Heterogeneous Dynamic Markets ⋮ A survey on skill-based routing with applications to service operations management ⋮ Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective Controls ⋮ A queueing system with on-demand servers: local stability of fluid limits ⋮ Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic ⋮ On the Control of Fork-Join Networks ⋮ Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks ⋮ Diffusion approximations for double-ended queues with reneging in heavy traffic ⋮ Reward maximization in general dynamic matching systems ⋮ Asymptotically Optimal Allocation Policies for Transplant Queueing Systems ⋮ A product form for the general stochastic matching model ⋮ A stochastic matching model on hypergraphs ⋮ Stabilizing policies for probabilistic matching systems ⋮ On the Optimal Design of a Bipartite Matching Queueing System
Cites Work
- Unnamed Item
- Unnamed Item
- Strong approximation of renewal processes
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- Correction: Brownian models of open processing networks: canonical representation of workload
- State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
- 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
- Heavy traffic resource pooling in parallel-server systems
- A Stochastic Programming Based Inventory Policy for Assemble-to-Order Systems with Application to the W Model
- Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times
- Assembly-like queues
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Optimal Control of a High-Volume Assemble-to-Order System
This page was built for publication:
