Modified N-policy for M/G/1 queues
Several researchers have studied the N-policy for queues. In this paper, we modify the N-policy for M/G/1 queue as follows: The server on becoming idle waits for the accumulation of N units for service. As soon as there are N units, he starts service for these N-units all together and subsequent arrivals during the busy period initiated by this receive single service. The service time distribution for bulk service is different from that of single service. Steady-state distribution is obtained. Optimal N value is investigated under distributional assumptions on service times. Numerical illustrations are provided. In the N-policy for queues an idle server is activated the moment N customers accumulate at the counter for service. Service is provided to one unit at a time. Then the N value that minimizes the total running cost is investigated. In the modified N-policy also the server is activated as in the usual N-policy. However, these first N units are served altogether. All subsequent arrivals during the busy period are served one at a time. The purpose is to bring down the waiting time of customers who encounter an idle server, to avoid customer impatience.
modified n-policy convex function