The Queue M/G/1 With Feedback to Lower Priority Queues

L. E. Schrage
Additional contact information
L. E. Schrage: Stanford University

Management Science, 1967, vol. 13, issue 7, 466-474

Abstract: The queue M/G/1 with a round-robin type queueing discipline is considered. The overall processing time of a job is assumed to consist of a sequence of "simple" processing times. There are a countably infinite number of waiting queues, 1,2,..., but a single processing facility. A job upon arrival enters the first, or highest priority waiting queue. When a job in the n th queue gains the processor, it receives its n th simple processing time in an uninterrupted fashion and then either departs or enters the n + 1 st queue. The processor upon completion of a simple processing time selects the job to be next processed from the highest priority (lowest index number) non-empty queue. Laplace transforms and expressions for the moments of the time in system distributions are obtained.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.7.466 (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:ormnsc:v:13:y:1967:i:7:p:466-474

Access Statistics for this article

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