On departure process in the batch arrival queue with single vacation and setup time

Wojciech M. Kempa

Abstract


A single-server queueing system of MX/G/1 type with unlimited buffer size is considered. Whenever the system becomes empty, the server takes a single compulsory vacation that is independent of the arrival process. The service of the first customer after the vacation is preceded by a random setup time. We distinguish two cases of the evolution of the system: when the setup time begins after the vacation only, or if it begins at once when the first group of customers enters. In the paper we investigate the departure process h(t) that at any fixed moment t takes on a random value equal to the number of customers completely served before t. An explicit representation for Laplace Transform of probability generating function of departure process is derived and written down by means of transforms of four crucial input distributions of the system and factors of a certain factorization identity connected with them. The results are obtained using the method consisting of two main stages: first we study departure process on a single vacation cycle for an auxiliary system and direct the analysis to the case of the system without vacations, applying the formula of total probability; next we use the renewal-theory approach to obtain a general formula.

Full Text:

PDF


DOI: http://dx.doi.org/10.17951/ai.2010.10.1.93-102
Data publikacji: 2010-01-01 00:00:00
Data złożenia artykułu: 2016-04-27 16:08:13

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.