Binomial schedule for an M/G/1 type queueing system with an unreliable server under N -policy

Abstract

We consider in this paper an M/G/1 type queueing system with the following extensions. First, the server is unreliable and is subject to random breakdowns. Second, the server also implements the well-known N -policy. Third, instead of a Bernoulli vacation schedule, the more general notion of binomial schedule with K vacations is applied. A cost function with two decision variables is developed. A numerical example shows the effect of the system parameters on the optimal management policy. © 2014 Lotfi Tadj and K. Paul Yoon.