The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
- 1 June 1990
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 22 (2) , 456-479
- https://doi.org/10.2307/1427545
Abstract
For the queue M/G/1 under the discipline SRPT (shortest remaining processing time) the system state is taken to be the counting measure N which assigns to each Borel set A of R+ the number N(A) of customers present with residual service times taking values in A. A steady-state analysis is given for the corresponding Laplace functional. As a corollary, the steady-state number in queue is obtained in terms of its generating function.Keywords
This publication has 6 references indexed in Scilit:
- Palm Probabilities and Stationary QueuesLecture Notes in Statistics, 1987
- A new approach to the M/G/1 processor-sharing queueAdvances in Applied Probability, 1984
- A new approach to the M/G/1 processor-sharing queueAdvances in Applied Probability, 1984
- WarteschlangenPublished by Springer Nature ,1973
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968
- The Queue M/G/1 with the Shortest Remaining Processing Time DisciplineOperations Research, 1966