The Queue M|G|1 with Markov Modulated Arrivals and Services

Published Online:https://doi.org/10.1287/moor.11.3.465

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.