Skip to main content
SpringerLink
Log in

On the come-and-stay interarrival time in a modified queueing system M/G/1

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

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

References

  1. D. V. Lindley, “The theory of queues with a single server,”Proc. Camb. Philos. Soc., Vol. 48 (1952), pp. 277–289

    MathSciNet  Google Scholar 

  2. D. G. Kendall, “Stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chain,”Ann. Math. Stat., Vol. 24 (1953), pp. 338–354

    Article  MathSciNet  MATH  Google Scholar 

  3. L. Takács, “Transient behavior of single server queueing processes with recurrent input and exponentially distributed service times,”Operations Res., Vol. 8 (1960), pp. 231–245

    Article  MATH  MathSciNet  Google Scholar 

  4. L. Takács, “The transient behavior of a single server queueing process with a Poisson input,”Proc. Fourth Berkeley Symp. (1961) pp. 535–567

  5. L. Takács,Introduction to the theory of queues, Oxford Univ. Press. (1962)

Download references

Author information

Authors and Affiliations

  1. Osaka University of Economics, USA

    Shunro Takamatsu

Authors
  1. Shunro Takamatsu
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Takamatsu, S. On the come-and-stay interarrival time in a modified queueing system M/G/1. Ann Inst Stat Math 15, 73–78 (1963). https://doi.org/10.1007/BF02865905

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02865905

Keywords

Search

Navigation