A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS
From MaRDI portal
Publication:4118639
DOI10.15807/jorsj.19.147zbMath0348.60127OpenAlexW614088647MaRDI QIDQ4118639
Yukio Takahashi, Yoshinori Takami
Publication date: 1976
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.19.147
Related Items (21)
An iterative aggregation-disaggregation algorithm for solving linear equations ⋮ Approximations for multi-server queues: System interpolations ⋮ Analysis of the stationary \(E_ k/C_ 2/s\) queueing system ⋮ Predicting the performance of queues -- a data analytic approach ⋮ Matrix-analytic methods in queueing theory ⋮ Comparison conjectures about the M/G/s queue ⋮ Algorithms for the state probabilities and waiting times in single server queueing systems with random and quasirandom input and phase-type service times ⋮ Multi-channel Queuing Systems with Markovian Impatience ⋮ Matrix-geometric solution of a multiserver queue with Markovian group arrivals and Coxian servers ⋮ Determining steady-state characteristics of some queuing systems with Erlangian distributions ⋮ A Sweep Method for Calculating Multichannel Queueing Systems ⋮ Recurrence relations for multichannel queueing systems with second-order Erlangian service times ⋮ Recurrence relations for two-channel queuing systems with Erlangian service time ⋮ Iterative solution of the \(M^{[x}/C_ 2/S/N\) queues] ⋮ Asymptotic behavior of the stationary distributions in the GI/PH/c queue with heterogeneous servers ⋮ Analyzing \(E_k/E_r/ c\) queues ⋮ Tables for M/G/c queuing systems with phase-type service ⋮ A numerical solution for the multi-server queue with hyper-exponential service times ⋮ Approximations for the conditional waiting times in the GI/G/c queue ⋮ An algorithm for Ph/Ph/c queues ⋮ Bounds for the mean queue length of the \(M/K_ 2/m\) queue
This page was built for publication: A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS