Queues Solvable without Rouché's Theorem

DOI10.1287/OPRE.27.4.767zbMATH Open0434.60094OpenAlexW2040490591MaRDI QIDQ3873288FDOQ3873288

Authors: M. F. Neuts 

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

zbMATH Keywords

steady-state probabilitiesdam with infinite capacity

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25)

Cited In (12)

• Title not available (Why is that?)
• Dynamic server assignment in a two-queue model
• On the numerical solution of a nonlinear matrix equation in Markov chains
• A class of iteration methods based on the Moser formula for nonlinear equations in Markov chains
• Statistical group testing with queueing involved
• On the role of Rouché's theorem in queueing analysis
• Matrix-analytic methods in queueing theory
• Computational procedures for steady-state characteristics of unscheduled multi-carrier shuttle systems
• Solving certain queueing problems modelled by Toeplitz matrices
• Performance analysis of a batch service queue arising out of manufacturing system modelling
• Semi-explicit solutions for M/PH/1-like queueing systems
• From the matrix-geometric to the matrix-exponential

This page was built for publication: Queues Solvable without Rouché's Theorem

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