1 paper
Jiheng Zhang, J. G. Dai, Bert Zwart
We consider a processor sharing queue where the number of jobs served at any time is limited to K, with the excess jobs waiting in a buffer. We use random counting measures on th…