Time-Varying Robust Queueing
From MaRDI portal
Publication:5129222
DOI10.1287/opre.2019.1846zbMath1444.90047OpenAlexW2971788046WikidataQ127301325 ScholiaQ127301325MaRDI QIDQ5129222
Publication date: 26 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1846
Related Items (5)
BROWNIAN MOTION MINUS THE INDEPENDENT INCREMENTS: REPRESENTATION AND QUEUING APPLICATION ⋮ Heavy traffic limits for queues with non-stationary path-dependent arrival processes ⋮ Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Queueing networks with path-dependent arrival processes
Cites Work
- Unnamed Item
- Unnamed Item
- Gaussian skewness approximation for dynamic rate multi-server queues with abandonment
- Robust transient analysis of multi-server queueing systems and feed-forward networks
- Stabilizing performance in a single-server queue with time-varying arrival rate
- Robust optimization - a comprehensive survey
- Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
- Queues with nonstationary inputs
- Strong approximation for Markovian service networks
- Uniform acceleration expansions for Markov chains with time-varying rates
- Heavy-traffic limits for a single-server queue leading up to a critical point
- Heavy-traffic limits for queues with periodic arrival processes
- Stochastic-Process Limits
- Performance Analysis of Queueing Networks via Robust Optimization
- Theory and Applications of Robust Optimization
- Fluid and diffusion limits for queues in slowly changing environments
- The asymptotic behavior o queues with time-varying arrival rates
- The Pointwise Stationary Approximation for Mt/Mt/s Queues Is Asymptotically Correct As the Rates Increase
- A Robust Optimization Approach to Inventory Theory
- Robust Queueing Theory
- Asymptotic Analysis of the Time Dependent M/M/1 Queue
- A Closure Approximation for the Nonstationary M/M/s Queue
- On queues with periodic Poisson input
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Time-Dependent Queues
- A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars
- Limit theorems for periodic queues
- Server Staffing to Meet Time-Varying Demand
- Numerical Solution of Piecewise-Stationary Mt/Gt/1 Queues
- Waiting time and workload in queues with periodic Poisson input
- Strong Approximations for Time-Dependent Queues
- Minimizing the Maximum Expected Waiting Time in a Periodic Single-Server Queue with a Service-Rate Control
- A Rare-Event Simulation Algorithm for Periodic Single-Server Queues
- APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT
- Queues with time-dependent arrival rates I—the transition through saturation
- Queues with time-dependent arrival rates. II — The maximum queue and the return to equilibrium
- Queues with time-dependent arrival rates. III — A mild rush hour
This page was built for publication: Time-Varying Robust Queueing
