Analysis of the Mx/G/1 queue by N-policy and multiple vacations

Abstract

We consider an Mx/G/1 queueing system with N-policy and multiple vacations. As soon as the system empties, the server leaves for a vacation of random length V. When he returns, if the queue length is greater than or equal to a predetermined value N(threshold), the server immediately begins to serve the customers. If he finds less than N customers, he leaves for another vacation and so on until he finally finds at least N customers. We obtain the system size distribution and show that the system size decomposes into three random variables one of which is the system size of ordinary Mx/G/1 queue. The interpretation of the other random variables will be provided. We also derive the queue waiting time distribution and other performance measures. Finally we derive a condition under which the optimal stationary operating policy is achieved under a linear cost structure.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 134 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.