×

The queueing system \(B_ D/G_ D/\infty\). (English) Zbl 0855.90064

Summary: We consider an infinite server queue in discrete-time and obtain the transient and limiting distribution of the number of busy servers in the system. First two moments of the system size and busy period distribution of the system are computed and an optimization problem is discussed.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI

References:

[1] Chaudhry M.L., A first course in bulk queues (1983) · Zbl 0559.60073
[2] Holman, D.F., Chaudhry, M.L. and Kashyap, B.R.K.On the number in the systemGlx/M/, SeriesA.Pt.1 294–297.
[3] Chaudhry M.L., European Journal of Operational Research 13 (2) (1983)
[4] Kashyap B.R.K., On the number in the system GI X/M/ (1991)
[5] Neuts M.F., Nav. Res.Logust 20 (2) pp 305– (1973) · Zbl 0266.60074 · doi:10.1002/nav.3800200211
[6] Krishnamoorthy, A. and Ushakumari, P.V. 1994. ”On some infinite server queues in discrete-time”. Communicated · Zbl 0869.90025
[7] Liu L., The service system M R with impatient customers, queueing systems 2 pp 362– (1987)
[8] Sivazlian B.D., Analysis of systems in operations research (1975)
[9] Takács L.V., traffic. Acta. Math. Acud. Sci.Hung 9 pp 45– (1958) · Zbl 0085.12603 · doi:10.1007/BF02023865
[10] Ushakumari P.V., An infinite server G I D M D queue (Communicated) (1994)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.