A Priority Rule Based on the Ranking of the Service Times for the M/G/1 Queue

This paper studies the virtual waiting time for the M/G/1 queue under this priority rule: within each generation, customers are served in the order of shortest (or longest) service times. It also considers the limiting behavior of the virtual waiting time, and compares the asymptotic means with those of the first-come, first-served discipline.