THE (n, N) POLICY OF THE M-X/G/1/K QUEUE WITH MULTIPLE REMOVABLE SERVER

Every time the server completes service and finds. customers in the system, the servers take a sequence of vacations. We consider an M-x/G/C/K queue in which the removable server applied the following (nu, N) policy. At the end of vacations, the server inspects the length of the queue. If the queue length is greater than or equal to N, the server begins service until the number of customer's drops to.. Under a classical cost structure, we characterize an optimal policy and develop an algorithm to find an optimal policy which minimize the expected cost per unit time. The (nu, N) policy has the following form "provide no service if the number of customers increases to N, turn the server on and continue serving until the customers drops again to nu. Teghem analyzed an optimal (nu, N) policy for the M-x/G/C with finite capacity.