Transient Solution of an Batch arrival Queue with Two Types of Service, Multiple Vacation, Random breakdown and Restricted Admissibility
DOI:
https://doi.org/10.24297/ijmit.v3i3.1747Keywords:
Non-Markovian Queue, Breakdown, Restricted admissibility policy, Multiple vacation, Mean queue sizeAbstract
In this paper we analyse a batch arrival queue with two types of service subject to random breakdowns having multiple server vacation. We assume that the server provides two types of service, type 1 with probability and type 2 with probability with the service times following general distribution and each arriving customer may choose either type of service. The server takes vacation each time the system becomes empty and the vacation period is assumed to be general. On returning from vacation if the server finds no customer waiting in the system, then the server again goes for vacation until he finds at least one customer in the system. The system may breakdown at random and repair time follows exponential distribution. In addition we assume restricted admissibility of arriving batches in which not all batches are allowed to join the system at all times. The time dependent probability generating functions have been obtained in terms of their Laplace transforms and the corresponding steady state results have been obtained explicitly. Average queue lenth and average system size are also computed.Downloads
Download data is not yet available.
Downloads
Published
2013-05-31
How to Cite
Sathiya, K., & Ayyappan, G. (2013). Transient Solution of an Batch arrival Queue with Two Types of Service, Multiple Vacation, Random breakdown and Restricted Admissibility. INTERNATIONAL JOURNAL OF MANAGEMENT &Amp; INFORMATION TECHNOLOGY, 3(3), 16–25. https://doi.org/10.24297/ijmit.v3i3.1747
Issue
Section
Articles
License
All articles published in Journal of Advances in Linguistics are licensed under a Creative Commons Attribution 4.0 International License.