Back to Search Start Over

On M[x]G1G21 queue with optional re-service

Authors :
Kailash C. Madan
Abedel-Qader Al-Masri
Amjad D. Al-Nasser
Source :
Applied Mathematics and Computation. 152:71-88
Publication Year :
2004
Publisher :
Elsevier BV, 2004.

Abstract

We study a single server queue with batch arrivals and two types of heterogeneous service with different general (arbitrary) service time distributions. The server provides either type of service to customers, one by one, on a first come, first served basis. Just before a service starts, a customer has the option to choose either type of service after completion of which the customer may leave the system or may opt for re-service of the service taken by him. We obtain steady-state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue and the system, the average number of customers and the average waiting time in the queue as well as the system. Some special cases of interest are discussed and some known results have been derived. A numerical illustration is provided.

Details

ISSN :
00963003
Volume :
152
Database :
OpenAIRE
Journal :
Applied Mathematics and Computation
Accession number :
edsair.doi...........0f0549e30793858fb3a25018480532b6
Full Text :
https://doi.org/10.1016/s0096-3003(03)00545-9