Article ID: | iaor20172966 |
Volume: | 17 |
Issue: | 2 |
Start Page Number: | 649 |
End Page Number: | 667 |
Publication Date: | Jul 2017 |
Journal: | Operational Research |
Authors: | Arumuganathan R, Senthil Kumar M, Jailaxmi V |
Keywords: | queues: applications |
In this paper, a single server retrial queue with general retrial time and collisions of customers with modified M‐vacations is studied. The primary calls arrive according to Poisson process with rate λ. If the server is free, the arriving customer/the customer from orbit gets served completely and leaves the system. If the server is busy, arriving customer collides with the customer in service resulting in both being shifted to the orbit. After the collision the server becomes idle. If the orbit is empty the server takes at most M vacations until at least one customer is recorded in the orbit when the server returns from a vacation. Whenever the orbit is empty the server leaves for a vacation of random length V. If no customers appear in the orbit when the server returns from vacation he again leaves for another vacation with the same length. This pattern continues until he returns from a vacation to find at least one customer recorded in the orbit or he has already taken M vacations. If the orbit is empty by the end of the Mth vacation, the server remains idle for customers in the system. The time between two successive retrials from the orbit is assumed to be general with arbitrary distribution R(t). By applying the supplementary variables method, the probability generating function of number of customers in the orbit is derived. Some special cases are also discussed. A numerical illustration is also presented.