Skip to main content
SpringerLink
Log in

An M/G/1 queue with second optional service

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study an M/G/1 queue with second optional service. Poisson arrivals with mean arrival rate λ (>0) all demand the first ‘essential’ service, whereas only some of them demand the second ‘optional’ service. The service times of the first essential service are assumed to follow a general (arbitrary) distribution with distribution function B(v) and that of the second optional service are exponential with mean service time 1/μ2 (μ2>0). The time-dependent probability generating functions have been obtained in terms of their Laplace transforms and the corresponding steady state results have been derived explicitly. Also the mean queue length and the mean waiting time have been found explicitly. The well-known Pollaczec–Khinchine formula and some other known results including M/D/1, M/Ek/1 and M/M/1 have been derived as particular cases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. U.N. Bhat, Imbedded Markov chain analysis of a single server bulk queue, J. Austral. Math. Soc. 4 (1964) 244–263.

    Google Scholar 

  2. A. Borthakur and J. Medhi, A queueing system with arrivals and services in batches of variable size, Cahiers Centre Études Rech. Opér. 16 (1974) 117–126.

    Google Scholar 

  3. M.L. Chaudhry and J.G.C. Templeton, The queueing system M/GB /1 and its ramifications, European J. Oper. Res. 6 (1981) 56–60.

    Google Scholar 

  4. B.D. Choi and K.K. Park, The M/G/1 retrial queue with Bernoulli schedule, Queueing Systems 7 (1990) 219–228.

    Google Scholar 

  5. J.W. Cohen, The Single Server Queue (North-Holland, Amsterdam, 1969).

    Google Scholar 

  6. D.P. Gaver, Imbedded Markov chain analysis of a waiting line process in continuous time, Ann. Math. Statist. 30 (1959) 698–720.

    Google Scholar 

  7. B.R.K. Kashyap and M.L. Chaudhry, An Introduction to Queueing Theory (A&A Publications, Kingston, Ontario, 1988).

    Google Scholar 

  8. J. Keilson and A. Kooharian, On time-dependent queueing processes, Ann. Math. Statist. 31 (1960) 104–112.

    Google Scholar 

  9. K.C. Madan, On a M[x] /M[b] /1 queueing system with general vacation times, Internat. J. Manag. Inform. Sci. 2 (1991) 51–60.

    Google Scholar 

  10. K.C. Madan, An M/G/1 queueing system with compulsory server vacations, Trabajos de Investigacion Operativa 1(7) (1992) 105–115.

    Google Scholar 

  11. J. Medhi, Stochastic Processes (Wiley Eastern, 1982).

  12. N.U. Prabhu, Queues and Inventories: A Study of Their Basic Stochastic Processes (Wiley, New York, 1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Faculty of Science, Yarmouk University, Irbid, Jordan

    Kailash C. Madan

Authors
  1. Kailash C. Madan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Madan, K.C. An M/G/1 queue with second optional service. Queueing Systems 34, 37–46 (2000). https://doi.org/10.1023/A:1019144716929

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019144716929

Search

Navigation