Decomposition approximations for time-dependent Markovian queueing networks

DOI10.1016/S0167-6377(99)00007-3zbMath0967.90026OpenAlexW2037897258MaRDI QIDQ1306456

Ward Whitt

Publication date: 4 October 1999

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00007-3

zbMATH Keywords

air traffic managementsystems of ordinary differential equationsdecomposition approximationstelephone call centersproduct-form approximationsproduct-form queueing networkstime-dependent Markov chains

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Markov and semi-Markov decision processes (90C40)

Related Items (3)

The analytical method of transient behavior of the \(M|M|1|n\) queuing system for piece-wise constant information flows ⋮ Approximate Transient Analysis of Queuing Networks by Quasi Product Forms ⋮ Nonstationary analysis of the loss queue and of queueing networks of loss queues

Cites Work

• Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
• Strong approximation for Markovian service networks
• Uniform acceleration expansions for Markov chains with time-varying rates
• Time-dependent queueing network approximations as simulation external control variates
• Networks of infinite-server queues with nonstationary Poisson input
• Some Effects of Nonstationarity on Multiserver Markovian Queueing Systems
• A Closure Approximation for the Nonstationary M/M/s Queue
• Server Staffing to Meet Time-Varying Demand
• Decomposition Algorithms for Analyzing Transient Phenomena in Multiclass Queueing Networks in Air Transportation
• Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

This page was built for publication: Decomposition approximations for time-dependent Markovian queueing networks