The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time

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.