Strong Embeddings for Transitory Queueing Models
From MaRDI portal
Publication:5085131
DOI10.1287/moor.2021.1158zbMath1492.60075arXiv1906.06740OpenAlexW3213507959MaRDI QIDQ5085131
Harsha Honnappa, Prakash Chakraborty
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.06740
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Functional limit theorems; invariance principles (60F17)
Cites Work
- Unnamed Item
- Unnamed Item
- The concert queueing game: to wait or to be late
- A new approach to strong embeddings
- Strong approximation of renewal processes
- Strong approximation for Markovian service networks
- Large finite population queueing systems: The single-server model
- Heavy-traffic limits for a single-server queue leading up to a critical point
- ?/M/1: On the equilibrium distribution of customer arrivals
- A queueing model with independent arrivals, and its fluid and diffusion limits
- Asymptotically Optimal Controls for Time-Inhomogeneous Networks
- Directional Derivatives of Oblique Reflection Maps
- Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- Reducing Delays for Medical Appointments: A Queueing Approach
- Rational Queueing
- Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
- On the accuracy of Kingman's heavy traffic approximation in the theory of queues
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- High-Dimensional Statistics
- Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes
- Rare events of transitory queues
- Strong Approximations for Time-Dependent Queues
- Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations
- Asymptotically Optimal Appointment Schedules
- A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic
- An invariance principle for the law of the iterated logarithm
- An asymptotic representation of the sample distribution function
This page was built for publication: Strong Embeddings for Transitory Queueing Models