Admissibility Policy

Abstract

In this paper, we propose to study such a model which deals with the aspects concerning the control of the arrival process. The paper deals with M/G/I queueing system with two types of rE[X]{01 E[B; ] +02E[B2]}{1 + AαE[V]} EL]= 1 – rλ£[ X ]{0; E[B1 |+02E[B2]} heterogeneous services and Bernoulli vacation schedule under a controlled admissibility policy of arriving batches. There is a single server who provides two types of parallel general heterogeneous services (one of which has to be chosen by each customer) to the customer on FCFS basis. Before starting the service, each customer has option to choose first service with probability or the second service with probability 0. The server's vacations are based on Bernoulli schedule under a single vacation policy where after completion of service (of any phase), the server either goes for a vacation of random length with probability a or may continue to serve the next customer with probability (1-x), if any, Under a controlled admissibility policy it is assumed that not all batches are allowed to join the system at all times. We obtain explicit queue size distribution at random epoch as well as at the departure epoch under the steady state conditions. In addition, some performance measures such as expected queue size and expected waiting time of a customer are also obtained. The numerical results for various performance measures are summarized displayed via graphs.