Batch arrival queue with \(N\)-policy and single vacation (Q1342331): Difference between revisions

The authors consider a production system which can be modelled as an \(M^ X/G/1/N\)-policy queue with single vacation. When the server returns from the vacation he waits in the system until the system size reaches or exceeds \(N\). They show that the system size distribution decomposes into two random variables one of which is the system size of the stationary \(M^ X/G/1\) queue. They derive the waiting time distribution and obtain an optimal operating policy under a linear cost structure.