Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions
From MaRDI portal
Publication:1243534
DOI10.1016/0377-2217(77)90049-2zbMath0371.60110OpenAlexW1552414204WikidataQ56764056 ScholiaQ56764056MaRDI QIDQ1243534
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
Queueing theory (aspects of probability theory) (60K25) Markov renewal processes, semi-Markov processes (60K15)
Related Items (18)
On the transient behavior of a finite birth-death process with an application ⋮ Means and variances of time averages in Markovian environments ⋮ Markov chain models of a telephone call center with call blending ⋮ Transient solutions for multidimensional denumerable state Markov processes ⋮ Moments computation for general Markov fluid models ⋮ Stochastic fluid models with positive jumps at level zero ⋮ On the use of MTBDDs for performability analysis and verification of stochastic systems. ⋮ History of Queueing Theory in Canada Prior to 1980 ⋮ Four Canadian Contributions to Stochastic Modeling ⋮ Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues ⋮ Transition probabilities for general birth-death processes with applications in ecology, genetics, and evolution ⋮ IRAP3: An interactive program for reliability analysis ⋮ Algorithms for Markov stochastic models ⋮ First passage times for multidimensional denumerable state Markov processes ⋮ A matrix-geometric solution of the jockeying problem ⋮ Bounds and Approximations for the Transient Behavior of Continuous-Time Markov Chains ⋮ Analyses of an M/M/N queue with servers' vacations ⋮ First passage times for Markov renewal processes and applications
Cites Work
This page was built for publication: Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions
