Main Article Content
Abstract
A single server Markovian queueing model is considered. The arrivals are allowed to join the queue according to a Poisson distribution and the service takes place according to an exponential distribution. Whenever the system is empty, the server goes for a vacation and return back to the system after N or more customers are found in the system. If the number of customers in the system is less than ‘’ then the server takes another vacation. In this paper, we obtain explicit expressions for the time dependent system size probabilities of such a model using Laplace transform and generating function techniques. Numerical illustrations are added to support the theoretical results obtained.
Keywords
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following License
CC BY: This license allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, so long as attribution is given to the creator. The license allows for commercial use.
