Queues Solvable without Rouché's Theorem
From MaRDI portal
Publication:3873288
DOI10.1287/opre.27.4.767zbMath0434.60094OpenAlexW2040490591MaRDI QIDQ3873288
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.4.767
Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (12)
Solving certain queueing problems modelled by Toeplitz matrices ⋮ Statistical group testing with queueing involved ⋮ On the role of Rouché's theorem in queueing analysis ⋮ Matrix-analytic methods in queueing theory ⋮ A class of iteration methods based on the Moser formula for nonlinear equations in Markov chains ⋮ From the matrix-geometric to the matrix-exponential ⋮ Computational procedures for steady-state characteristics of unscheduled multi-carrier shuttle systems ⋮ Unnamed Item ⋮ Dynamic server assignment in a two-queue model ⋮ Semi-explicit solutions for M/PH/1-like queueing systems ⋮ On the numerical solution of a nonlinear matrix equation in Markov chains ⋮ Performance analysis of a batch service queue arising out of manufacturing system modelling
This page was built for publication: Queues Solvable without Rouché's Theorem
