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

DOI10.1016/0167-6377(83)90028-7MaRDI QIDQ789115zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Analysis of queues with hyperexponential arrival distributions
• Algorithms for the multi-server queue with phase type service
• Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals
• An algorithm for Ph/Ph/c queues
• Computing steady-state queueing-time distributions of single-server queues:GI X /M/1

Cites work

• scientific article; zbMATH DE number 3860152 (Why is no real title available?)
• A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS
• The queue GI/M/s with customers of different types or the queue GI/H_m/s

Cited in

(13)

• Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals
• An algorithm for Ph/Ph/c queues
• The impact of a global FCFS service discipline in a two-class queue with dedicated servers
• A matrix-geometric solution of the jockeying problem
• HYPEREXPONENTIAL WAITING TIME STRUCTURE IN HYPEREXPONENTIAL H_K/H_L/1 SYSTEMS
• An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
• scientific article; zbMATH DE number 4133277 (Why is no real title available?)
• On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems
• A numerically stable algorithm for two server queue models
• On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
• Some explicit formulas for mixed exponential service systems
• Analysis of the stationary \(E_ k/C_ 2/s\) queueing system
• Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789115)