Approximations of the Mean Waiting Time in an M/G/s Queueing System

DOI10.1287/OPRE.27.6.1115MaRDI QIDQ3881691zbMATH OpenOpenAlexFDO

Authors J. W. Cohen, N. Huffels, Onno Boxma

Publication date 1979

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.27.6.1115

zbMATH Keywords

heavy-traffic approximationsmean waiting time approximationsstationary waiting time distribution

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cited in

(15)

• Locating and staffing service centers under service level constraints
• Bounds for the mean queue length of the \(M/K_ 2/m\) queue
• Processor-sharing queues: Some progress in analysis
• A review of open queueing network models of manufacturing systems
• Approximations for multi-server queues: System interpolations
• Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities.
• Approximate solution for multi-server queueing systems with Erlangian service times
• Approximations for the delay probability in the \(M/G/s\) queue
• An approximation for multi-server queues with deterministic reneging times
• Predicting the performance of queues -- a data analytic approach
• Optimal pricing and scheduling control of product shipping
• Minimising average passenger waiting time in personal rapid transit systems
• The number of overlapping customers
• Tables for M/G/c queuing systems with phase-type service
• On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough

This page was built for publication: Approximations of the Mean Waiting Time in an M/G/s Queueing System

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