The Pht/Pht/∞ Queueing System: Part I—The Single Node
From MaRDI portal
Publication:2890425
DOI10.1287/IJOC.1040.0070zbMath1239.90031OpenAlexW2152555763MaRDI QIDQ2890425
Barry L. Nelson, Michael R. Taaffe
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1040.0070
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (6)
Simulation-based transfer function modeling for transient analysis of general queueing systems ⋮ Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues ⋮ Two time-varying and state-dependent fluid queuing models for traffic circulation systems ⋮ Diffusion limits for the $(MAP_t / Ph_t / \infty)^N$ queueing network ⋮ Virtual Statistics in Simulation via k Nearest Neighbors ⋮ Two-parameter process limits for an infinite-server queue with arrival dependent service times
This page was built for publication: The Pht/Pht/∞ Queueing System: Part I—The Single Node
