A numerical solution for the multi-server queue with hyper-exponential service times

DOI10.1016/0167-6377(83)90028-7zbMath0532.60096OpenAlexW2091650089MaRDI QIDQ789115

Jos H. A. de Smit

Publication date: 1983

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

Full work available at URL: https://research.utwente.nl/en/publications/a-numerical-solution-for-the-multiserver-queue-with-hyperexponential-service-times(edb52dea-617a-4c4a-8200-725bbdc993c0).html

zbMATH Keywords

queue lengthvirtual waiting timemulti-server queueactual waiting timesteady state distributionshyper-exponential service times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough ⋮ Analysis of the stationary \(E_ k/C_ 2/s\) queueing system ⋮ The impact of a global FCFS service discipline in a two-class queue with dedicated servers ⋮ Unnamed Item ⋮ On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems ⋮ Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities. ⋮ An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities ⋮ An algorithm for Ph/Ph/c queues

Cites Work

• Unnamed Item
• The queue GI/M/s with customers of different types or the queue GI/H_m/s
• A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS

This page was built for publication: A numerical solution for the multi-server queue with hyper-exponential service times