Article ID: | iaor2007466 |
Country: | Netherlands |
Volume: | 160 |
Issue: | 3 |
Start Page Number: | 909 |
End Page Number: | 919 |
Publication Date: | Jan 2005 |
Journal: | Applied Mathematics and Computation |
Authors: | Madan Kailash C., Al-Rawwash Mohammad |
Keywords: | M/G/1 queues, vacation models |
We study a single server queue with batch arrivals and general (arbitrary) service time distribution. The server provides service to customers, one by one, on a first come, first served basis. Just after completion of his service, a customer may leave the system or may opt to repeat his service, in which case this customer rejoins the queue. Further, just after completion of a customer's service the server may take a vacation of random length or may opt to continue staying in the system to serve the next customer. 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, the average number of customers and the average waiting time in the queue. Some special cases of interest are discussed and some known results have been derived. A numerical illustration is provided.