Abstract
A general model for the single server semi-Markov queue is studied. Its solution is reduced to a matrix factorization problem. Given this factorization, results are obtained for the distributions of actual and virtual waiting times, queue lengths both at arrival epochs and in continuous time, the number of customers during a busy period, its length and the length of a busy cycle. Two examples are discussed for which explicit factorizations have been obtained.
| Original language | English |
|---|---|
| Pages (from-to) | 37-50 |
| Journal | Stochastic processes and their applications |
| Volume | 22 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1986 |