\(M/G/1/K\) queues with \(N\)-policy and setup times (Q688648)

The paper deals with the following systems of \(M/G/1/K\) queues: (i) The exhaustive service system, in which the server continues to serve till the system becomes empty. \(N\) customers must be accumulated before service can be started and a setup time is needed before starting each service period. (ii) The \(E\)-limited service system, in which a maximum of \(M\) customers can be continuously served in a service period. The rule to start service is as follows. If there are less than \(N\) customers left in the system at the end of a service period, the server waits until \(N\) customers have accumulated and then a setup time is needed. If there are \(N\) or more customers in the system at the end of a service period, the next service period starts immediately. (iii) The \(G\)-limited service system, in which each service period is started with \(N\) or more customers present in the system and it is terminated either when \(M\) customers out of those that were waiting at the beginning of the service period have been served or when the system has been emptied, whichever occurs first. If there are \(N\) customers left in the system at the end of a service period, the next period is immediately started. Otherwise the server stays idle until \(N\) customers accumulate in the queue and then a setup time is needed before starting the service. Choosing a suitable set of imbedded Markov points, the queue length distribution and the meen waiting time are obtained for each system. Numerical results give the mean waiting time against the various arrival rates.