Abstract
We consider an M/G/1 queueing model with N-policy operating. This means, that the server will start up only if a queue of a prescribed length has built up. For this model the time dependent distribution of the queue length is given by simple renewal arguments without resorting to integral transform techniques.
Similar content being viewed by others
References
Bhat U. N. (1968) A Study of the Queueing Systems M/G/1 and GI/M/1.Lecture Notes in Operations Research and Mathematical Economics, Springer, Berlin.
Champernowne D. G. (1956) An elementary method of the solution of the queucing problem with a single server and constant parameters.J. Roy. Stat. Soc. Ser. B,18, 125–128.
Heymann D. P. (1968) Optimal operating policies for M/G/1 queueing systems.Opns. Res.,16, 362–382.
Jaiswal N. K. (1968)Priority Queues. Academic Press, New York.
Prabhu N. U. (1960) Some results for the queue with Poisson arrivals.J. Roy. Stat. Soc. Ser. B.,22, 104–107.
Prabhu N. U. (1965)Queues and Inventories. John Wiley and Sons, New York.
Takács L. (1961) The probability law of the busy period for two types of queueing processes.Opns. Res. 9, 402–407.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Böhm, W. A transient analysis of M/G/1 queues with N-policy. Statistical Papers 33, 151–157 (1992). https://doi.org/10.1007/BF02925320
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02925320