A Time-Sharing Model with Many Queues

I. Adiri and B. Avi-Itzhak
Additional contact information
I. Adiri: Technion—Israel Institute of Technology, Haifa, Israel
B. Avi-Itzhak: Technion—Israel Institute of Technology, Haifa, Israel

Operations Research, 1969, vol. 17, issue 6, 1077-1089

Abstract: This paper presents a mathematical study of a time-sharing system with a single server and many queues. In each queue a customer receives one quantum of service and is then sent to the end of the next queue, provided his service demand has not been completely satisfied. When a quantum of service is completed, the server attends to the first customer in the lowest-index nonempty queue. The discipline of the highest indexed queue is “round-robin,” while all other queues obey the FIFO rule. Newly arrived customers join the end of the first queue. The paper derives mathematical expressions for the main performance measures and illustrates them by graphical means.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.6.1077 (application/pdf)

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:inm:oropre:v:17:y:1969:i:6:p:1077-1089

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().