A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity (Q1592328): Difference between revisions

In an M/G/1 queueing system the server is turned off whenever the system becomes empty and turned on again as soon as \(N\) customers are present. The number \(N\) is the parameter that can be controlled for an optimal operating policy. The main feature in this paper is the consideration of a finite waiting room. The authors describe a recursive method to determine the steady state probabilities for the queue length. Simple special cases are worked out in detail.