The authors treat the GI/M/1 queue with a processor-sharing server, in the heavy traffic case. Using perturbation methods, they construct asymptotic expansions for the conditional sojourn time distribution of a tagged customer conditioned on the tagged customer’s service time. The resulting approximation is simple in form and involves only the first three moments of the interarrival time distribution.
