Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions

DOI10.1016/0377-2217(77)90049-2zbMath0371.60110WikidataQ56764056 ScholiaQ56764056MaRDI QIDQ1243534

Winfried K. Grassmann

Publication date: 1977

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(77)90049-2

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

60K15: Markov renewal processes, semi-Markov processes

Related Items

Transition probabilities for general birth-death processes with applications in ecology, genetics, and evolution, A matrix-geometric solution of the jockeying problem, Algorithms for Markov stochastic models, First passage times for multidimensional denumerable state Markov processes, Analyses of an M/M/N queue with servers' vacations, Markov chain models of a telephone call center with call blending, Means and variances of time averages in Markovian environments, IRAP3: An interactive program for reliability analysis, Transient solutions for multidimensional denumerable state Markov processes, On the use of MTBDDs for performability analysis and verification of stochastic systems., First passage times for Markov renewal processes and applications, On the transient behavior of a finite birth-death process with an application, Bounds and Approximations for the Transient Behavior of Continuous-Time Markov Chains

Cites Work

• Queues with Service in Random Order
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item