Minimizing the Maximum Expected Waiting Time in a Periodic Single-Server Queue with a Service-Rate Control
From MaRDI portal
Publication:5113900
DOI10.1287/stsy.2018.0027zbMath1446.60071OpenAlexW2972131452WikidataQ127300046 ScholiaQ127300046MaRDI QIDQ5113900
Publication date: 18 June 2020
Published in: Stochastic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/stsy.2018.0027
nonstationary queuesheavy traffic limitsservice-rate controlsstabilizing performancequeues with time-varying arrival rate
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (4)
Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates ⋮ Time-Varying Robust Queueing ⋮ Optimal routing for electric vehicle charging systems with stochastic demand: a heavy traffic approximation approach ⋮ Queues with path-dependent arrival processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(G_{t}/GI/s_{t}+GI\) many-server fluid queue
- Handbook of simulation optimization
- Dynamic admission and service rate control of a queue
- Efficient simulation of non-Poisson non-stationary point processes to study queueing approximations
- Stabilizing performance in a single-server queue with time-varying arrival rate
- Equivalence of functional limit theorems for stationary point processes and their Palm distributions
- Queues with nonstationary inputs
- Transient laws of non-stationary queueing systems and their applications
- Heavy-traffic limits for queues with periodic arrival processes
- Marked point processes in discrete time
- Approximation of the non-stationary \(M(t)/M(t)/c(t)\)-queue using stationary queueing models: The stationary backlog-carryover approach
- Stochastic simulation: Algorithms and analysis
- Stochastic-Process Limits
- Staffing of Time-Varying Queues to Achieve Time-Stable Performance
- Fluid and diffusion limits for queues in slowly changing environments
- A Network of Time-Varying Many-Server Fluid Queues with Customer Abandonment
- A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
- Dynamic Control of a Queue with Adjustable Service Rate
- Periodic queues in heavy traffic
- Queues with non-stationary input stream: Ross's conjecture
- Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations
- Unstable Asymptotics for Nonstationary Queues
- Server Staffing to Meet Time-Varying Demand
- On the Invariance Principle for the First Passage Time
- Applied Probability and Queues
- Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
- Staffing to Stabilize the Tail Probability of Delay in Service Systems with Time-Varying Demand
- Periodic Little’s Law
- Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates
- A Rare-Event Simulation Algorithm for Periodic Single-Server Queues
- STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS
- APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT
- Optimal Operating Policies for M/G/1 Queuing Systems
- Weak convergence theorems for priority queues: preemptive-resume discipline
This page was built for publication: Minimizing the Maximum Expected Waiting Time in a Periodic Single-Server Queue with a Service-Rate Control
