Cost Analysis of MAP/G(a, b)/1/N Queue with Multiple Vacations and Closedown Times

Abstract

This paper gives the cost analysis of a finite capacity single server bulk queueing model with closedown times. The server serves the customers in batches of maximum size ‘b’ with a minimum threshold value ‘a’. Customers arrive according to a Markovian Arrival Process (MAP). On completion of a service, if the queue length is less than ‘a’, then the server performs a closedown work and then leaves for a vacation of random length. When the server returns from vacation and if the queue length is still less than ‘a’ he avails another vacation and so on until the server finds ‘a’ customers waiting in the queue. After the completion of a service, if the number of customers in the queue is greater than a specified value ‘a’ then the server will continue the batch service with general bulk service rule. On the other hand, if the server finds at least ‘a’ customers during closedown period, he immediately starts serving the batch of ‘a’ customers. Using supplementary variable and imbedded Markov chain technique, queue length distribution at arbitrary epoch is obtained. Some key performance measures are also obtained. Cost model is discussed with Numerical illustration.