A two-moment approximation for the GI/G/c queue with finite capacity

DOI10.1287/IJOC.1030.0058zbMATH Open1239.90029OpenAlexW2103727428MaRDI QIDQ2890458FDOQ2890458

Authors: Dae Won Choi, Nam K. Kim, Kyung C. Chae 

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1030.0058

Recommendations

• Simple Approximations for the GI/G/c Queue-II: The Moments, the Inverse Distribution Function and the Loss Function of the Number in the System and of the Queue Delay
• A Transform-Free Approximation for the Finite Capacity M/G/s Queue
• Approximations for the GI/G/c queue
• A Two-Moment Approximation for the Mean Waiting Time in the GI/G/s Queue
• Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula

zbMATH Keywords

multiple serversfinite capacity queuequeues approximations

Mathematics Subject Classification ID

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

Cited In (12)

• Simple Approximations for the GI/G/c Queue-II: The Moments, the Inverse Distribution Function and the Loss Function of the Number in the System and of the Queue Delay
• Properties and performance modelling of finite buffer \(M/G/1/K\) networks
• M/G/c/K PERFORMANCE MODELS IN MANUFACTURING AND SERVICE SYSTEMS
• NOTE ON APPROXIMATIONS FOR THE MULTISERVER QUEUE WITH FINITE BUFFER AND DETERMINISTIC SERVICES
• Topological network design of general, finite, multi-server queueing networks
• Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula
• On the total customers' capacity in multi-server queues
• On the two-moment approximation of the discrete-time \(\mathrm{GI}/\mathrm{G}/1\) queue with a single vacation
• Performance optimization of open zero-buffer multi-server queueing networks
• Capacity planning of a perinatal network with generalised loss network model with overflow
• Closed-form approximations for the URLLC capacity using \(G/G/s\) queues
• Correction to: ``Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems

This page was built for publication: A two-moment approximation for the \(GI/G/c\) queue with finite capacity

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