Dynamic rate Erlang-A queues
type: Item
instance of: scholarly article
title: Dynamic rate Erlang-A queues
zbMATH Open document ID: 1408.60085
author: William A. Massey
author: Jamol Pender
published in: Queueing Systems
publication date: 2018-11-02T00:00:00Z
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 6971478
zbMATH Keywords: multi-server queues
zbMATH Keywords: abandonment
zbMATH Keywords: dynamical systems
zbMATH Keywords: asymptotics
zbMATH Keywords: time-varying rates
zbMATH Keywords: time-inhomogeneous Markov processes
zbMATH Keywords: Hermite polynomials
zbMATH Keywords: fluid and diffusion limits
zbMATH Keywords: skewness
zbMATH Keywords: cumulant moments
MaRDI profile type: Publication
full work available at URL: s11134-018-9581-2
OpenAlex ID: W2802633867
cites work: Heavy-traffic asymptotic expansions for the asymptotic decay rates in theBMAP/G/1 queue
cites work: Queues Driven by Hawkes Processes
cites work: A nonstationary offered-load model for packet networks
cites work: Mt/G/∞ Queues with Sinusoidal Arrival Rates
cites work: The Physics of the Mt/G/∞ Queue
cites work: Staffing of Time-Varying Queues to Achieve Time-Stable Performance
cites work: Correlation inequalities on some partially ordered sets
cites work: Heavy-Traffic Limits for Queues with Many Exponential Servers
cites work: Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
cites work: STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS
cites work: A survey and experimental comparison of service-level-approximation methods for nonstationary \(M(t)/M/s(t)\) queueing systems with exhaustive discipline
cites work: Server Staffing to Meet Time-Varying Demand
cites work: Diffusion limits for the $(MAP_t / Ph_t / \infty)^N$ queueing network
cites work: Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes
cites work: STAFFING TO STABILIZE BLOCKING IN LOSS MODELS WITH TIME-VARYING ARRIVAL RATES
cites work: Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
cites work: STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES
cites work: Stabilizing performance in a service system with time-varying arrivals and customer feedback
cites work: Strong approximation for Markovian service networks
cites work: Sur une propriété de la loi de Gauss
cites work: Asymptotic Analysis of the Time Dependent M/M/1 Queue
cites work: Gaussian skewness approximation for dynamic rate multi-server queues with abandonment
cites work: Networks of infinite-server queues with nonstationary Poisson input
cites work: Uniform acceleration expansions for Markov chains with time-varying rates
cites work: Optimal staffing in nonstationary service centers with constraints
cites work: Gram Charlier Expansion for Time Varying Multiserver Queues with Abandonment
cites work: A Poisson-Charlier approximation for nonstationary queues
cites work: NONSTATIONARY LOSS QUEUES VIA CUMULANT MOMENT APPROXIMATIONS
cites work: The truncated normal distribution: applications to queues with impatient customers
cites work: Risk measures and their application to staffing nonstationary service systems
cites work: Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks
cites work: Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues
cites work: APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT
cites work: A Law of Large Numbers for M/M/c/Delayoff-Setup Queues with Nonstationary Arrivals
cites work: Queues with Choice via Delay Differential Equations
cites work: An analysis of queues with delayed information and time-varying arrival rates
cites work: On the \(M_t/M_t/K_t + M_t\) queue in heavy traffic
cites work: A Closure Approximation for the Nonstationary M/M/s Queue
cites work: Q4000424
cites work: Approximating nonstationary two-priority non-preemptive queueing systems
cites work: Approximating a Point Process by a Renewal Process, I: Two Basic Methods
cites work: Many‐server loss models with non‐poisson time‐varying arrivals
DOI: 10.1007/S11134-018-9581-2
description: scientific article; zbMATH DE number 6971478