A Transform-Free Approximation for the Finite Capacity M/G/s Queue

DOI10.1287/opre.44.6.984zbMath0879.90098OpenAlexW2149955401MaRDI QIDQ4346336

Toshikazu Kimura

Publication date: 3 August 1997

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

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

zbMATH Keywords

M/G/s queuesteady-state queue-length distributionfinite waiting spaces

Mathematics Subject Classification ID

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

Related Items (14)

Predicting the performance of queues -- a data analytic approach ⋮ A consistent diffusion approximation for finite-capacity multiserver queues ⋮ Properties and performance modelling of finite buffer \(M/G/1/K\) networks ⋮ Multi-server, Finite Waiting Room,M/G/c/KOptimization Models ⋮ Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers ⋮ M/G/c/K PERFORMANCE MODELS IN MANUFACTURING AND SERVICE SYSTEMS ⋮ Buffer and server allocation in general multi-server queueing networks ⋮ An algorithm for repairable item inventory system with depot spares and general repair time distribution ⋮ Buffer allocation in general single-server queueing networks ⋮ Optimal design and performance modelling of \(M/G/1/K\) queueing systems ⋮ Average waiting time of customers in a priority M/D/k queue with finite buffers ⋮ Topological network design of general, finite, multi-server queueing networks ⋮ Equivalence relations in the approximations for the \(M/G/s/s+r\) queue. ⋮ Approximate solution for multi-server queueing systems with Erlangian service times

This page was built for publication: A Transform-Free Approximation for the Finite Capacity M/G/s Queue