Abstract
We consider a processor shared GI/M/1 queue which can accommodate a finite number K of customers. Using singular perturbation techniques, we construct asymptotic expansions for the distribution of a tagged customer's sojourn time. We assume that K is large and treat several different cases of the model parameters.