Skip to main content
SpringerLink
Log in

A multi‐class cyclic arrival queue with a single server

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Motivated by cyclic scheduling in the presence of random machine failures, this paper studies the following queueing system. A single server serves customers from n classes who arrive in a cyclic manner: after the arrival of a customer from class i, the next arriving customer is from class i + 1 (modulo n). The interarrival times between classes and the service times may have different distributions for different classes. All service times and interarrival times are independent of one another. Arrivals form a single queue and the service discipline is first-come first‐served (FCFS). This paper presents an algorithm that finds the waiting time distribution for each customer class under the condition that all service times have rational Laplace transforms. A variety of examples are presented. Exponentiality of the waiting time under heavy traffic is proven.

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. S. Albin, Delays for customers from different arrival streams to a queue, Management Science 32(1986).

  2. D. Bertsimas and D. Nakazato, Transient and busy period analysis of the GI/G/1 queue using the method of stages, Queueing Systems 10(1992).

  3. D. Bertsimas, J. Keilson, D. Nakazato and H. Zhang, Transient and busy period analysis of the GI/G/1 queue as a Hilbert factorization problem, Journal of Applied Probability 28(1991).

  4. J. Keilson, Green's Function Methods in Probability Theory, Charles Griffin, London, 1965.

    Google Scholar 

  5. J.F.C. Kingman, The single server queue in heavy traffic, Proceedings of the Cambridge Philosophical Society 57(1961).

  6. H. Takagi, Analysis of Polling Systems, MIT Press, 1986.

  7. H. Takagi, Queueing analysis of polling models: An update, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi, North-Holland, Amsterdam, 1990.

    Google Scholar 

  8. H. Zhang and S.C. Graves, Cyclic scheduling in a stochastic environment, Operations Research 45(1997).

Download references

Authors
  1. H. Zhang
    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

Zhang, H. A multi‐class cyclic arrival queue with a single server. Annals of Operations Research 87, 333–350 (1999). https://doi.org/10.1023/A:1018997322610

Download citation

  • Issue Date:

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

Keywords

Search

Navigation