Approximation of the Mean Queue Length of an M/G/c Queueing System
From MaRDI portal
Publication:4838246
DOI10.1287/OPRE.43.1.158zbMath0830.90058DBLPjournals/ior/MaM95OpenAlexW2065004605WikidataQ56907809 ScholiaQ56907809MaRDI QIDQ4838246
Publication date: 1 August 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.1.158
Communication networks in operations research (90B18) Queues and service in operations research (90B22)
Related Items (7)
On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough ⋮ Predicting the performance of queues -- a data analytic approach ⋮ On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems ⋮ Equilibrium and optimal strategies to join a queue with partial information on service times ⋮ Queuing Management with Feedback in Cloud Computing Centers with Large Numbers of Web Servers ⋮ Approximate solution for multi-server queueing systems with Erlangian service times ⋮ A two-stage approach for task and resource management in multimedia cloud environment
This page was built for publication: Approximation of the Mean Queue Length of an M/G/c Queueing System
