| Article ID: | iaor1997752 |
| Country: | United Kingdom |
| Volume: | 47 |
| Issue: | 6 |
| Start Page Number: | 817 |
| End Page Number: | 828 |
| Publication Date: | Jun 1996 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Gupta Surendra M., Karaesmen Fikri |
| Keywords: | GI/G/1 queues |
This paper considers the GI/M/1/K queue where the server takes exponentially distributed vacations when there are no customers left to serve in the queue. It obtains the queue length distribution at arrival epochs and random epochs for the multiple vacation case. It presents heuristic algorithms to compute the blocking probability for this system. Several numerical examples are presented to analyze the behaviour of the blocking probability and to test the performance of the heuristics.