Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues

DOI10.3138/infor.52.4.197MaRDI QIDQ6160433

Javad Tavakoli, Winfried K. Grassmann

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

zbMATH Keywords

queueingcomputational complexityMarkov processes

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions
• Analysis of multi-server queues with station and server vacations
• Exact convergence rate for the distributions of \(GI\)/\(M\)/\(c\)/\(K\) queue as \(K\) tends to infinity
• Stationary distributions of \(GI/M/c\) queue with PH type vacations
• Analysis of \(\text{GI}/\text{M}/s/c\) queues using uniformisation
• On a GI/M/c Queue with Bounded Waiting Times
• The G/M/m queue with finite waiting room
• A comparison of the stationary distributions of GI/M/c/n and GI/M/c
• Rounding errors in certain algorithms involving Markov chains
• The GI/PH/1 Queue: a Method to Find The Transition Matrix
• A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES
• Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
• Analysis of finite-buffer multi-server queues with group arrivals: GI\(^{X}\)/M/\(c\)/N

This page was built for publication: Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues