Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/informs/the-queue-m-g-1-with-feedback-to-lower-priority-queues-jFhrrnjppJ
References (7)
-
Jr. Coffman (1966)
Stochastic models of multiple and time-shared computer operations. -
L. Kleinrock (1964)
Analysis of A time‐shared processorNaval Research Logistics Quarterly, 11
-
A. Miller, A. Kaufmann, R. Cruon, T. Saaty, L. Takács (1963)
Introduction to the Theory of Queues.American Mathematical Monthly, 70
-
L. Schrage, L. Miller (1966)
The Queue M/G/1 with the Shortest Remaining Processing Time DisciplineOper. Res., 14
-
H. Kesten, J. Runnenburg (1957)
Priority in Waiting Line Problems 1). II, 60
-
Walter Smith (1958)
Renewal Theory and its RamificationsJournal of the royal statistical society series b-methodological, 20
-
L. Takács (1963)
A single-server queue with feedbackBell System Technical Journal, 42
- Publisher
- INFORMS
- Copyright
- Copyright © INFORMS
- Subject
- Research Article
- ISSN
- 0025-1909
- eISSN
- 1526-5501
- DOI
- 10.1287/mnsc.13.7.466
- Publisher site
- See Article on Publisher Site
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 nth queue gains the processor, it receives its nth simple processing time in an uninterrupted fashion and then either departs or enters the n 1st 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.
Journal
Management Science – INFORMS
Published: Mar 1, 1967