Modified N-policy for M/G/1 queues

Authors:
A. Krishnamoorthy;T. G. Deepak
Affiliations:
Department of Mathematics, Cochin University of Science and Technology, Cochin 682 022, India;Department of Mathematics, Cochin University of Science and Technology, Cochin 682 022, India
Venue:
Computers and Operations Research
Year:
2002

Citing 1
Cited 2

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).

A discrete-time single-server queue with a modified N-policy

International Journal of Systems Science
Near optimal buffer allocation in remanufacturing systems with N-policy

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.