Abstract
We study an M|G|1 queue in which both the arrival rate and the service time distribution depend on the state of an underlying finite-state Markov chain. The solution is obtained by a matrix factorization method. This leads to results for waiting times and queue lengths both at arrival epochs and in continuous time. A numerical algorithm for the calculation of several quantities of interest is described and some numerical examples are given.
Original language | Undefined |
---|---|
Pages (from-to) | 465-483 |
Journal | Mathematics of operations research |
Volume | 11 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1986 |
Keywords
- IR-98505