A Retrial Queueing System in which Server Searches to Accumulate Customers for Optimal Bulk Serving.

In this paper, we introduce the concept of orbital search as a means for accumulating customers in a bulk service retrial queueing system. In this model, customers enter the service facility from a finite buffer. If the buffer is full at the time of arrival of a customer, it enters an orbit from where retrials for entering the buffer has been made. Here search is done as a means for accumulating customers in the buffer so that optimum level of bulk service can be provided. A service policy considered here is (a,b) bulk service policy with search. Under this policy, search will be initiated when the number of customers in the buffer reaches 'a' and it has been continued until either the search has been done for a random duration of time or the number of customers in the buffer increases to 'b' where a<b. Steady state analysis of the model has been done and some important measures of performance has been evaluated. We analyze the model numerically as well as graphically.