A simple solution for the M/D/c waiting time distribution
From MaRDI portal
Publication:1604055
DOI10.1016/S0167-6377(01)00108-0zbMath0993.90026OpenAlexW2095331274WikidataQ56765012 ScholiaQ56765012MaRDI QIDQ1604055
Publication date: 3 July 2002
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00108-0
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items
Analysis of an \(M/\{D_{n}\}/1\) retrial queue ⋮ Computational procedures for a class of GI/D/\(k\) systems in discrete time ⋮ A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues ⋮ Optimal Routing of Fixed Size Jobs to Two Parallel Servers ⋮ Waiting time distribution of the \(MAP/D/k\) system in discrete time -- a more efficient algorithm. ⋮ On queues with service and interarrival times depending on waiting times ⋮ Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime ⋮ Combining revenue and equity in capacity allocation of imaging facilities ⋮ Algorithmic analysis of the BMAP/D/k system in discrete time ⋮ Exact boundaries in sequential testing for phase-type distributions ⋮ Analytical distribution of waiting time in the M/\{iD\}/1 queue ⋮ NEGATIVE PROBABILITIES AT WORK IN THE M/D/1 QUEUE
Cites Work
