A multi‐class cyclic arrival queue with a single server

H. Zhang

Annals of Operations Research, 1999, vol. 87, issue 0, 333-350

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. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018997322610 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:87:y:1999:i:0:p:333-350:10.1023/a:1018997322610

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018997322610

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().