Ein Algorithmus für das zeitabhängige Verhalten eingebetteter Markoff-Ketten bei den WartesystemenM (Y)/Gm/1 undGI m/M(Y)/1
From MaRDI portal
Publication:5640552
DOI10.1007/BF01939832zbMath0232.60084MaRDI QIDQ5640552
Publication date: 1971
Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Transient Behavior of Single-Server Queueing Processes With Erlang Input
- The Transient Behavior of a Single Server Queuing Process with Recurrent Input and Gamma Service Time
- The Probability Law of the Busy Period for Two Types of Queuing Processes
- A Generalization of the Ballot Problem and its Application in the Theory of Queues
- A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times
- Imbedded Markov chain analysis of single server bulk queues
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ein Algorithmus für das zeitabhängige Verhalten eingebetteter Markoff-Ketten bei den WartesystemenM (Y)/Gm/1 undGI m/M(Y)/1
