Minimizing the externalities variance in a LCFS-PR $M/G/1$ queue under various constraints

Royi Jacobovic, Nikki Levering

Consider a LCFS-PR $M/G/1$ queue and assume that at time $t=0$, there are $n+2$ customers $c_1,c_2,...,c_{n+1},c$ who arrived in that order such that $t=0$ is the arrival time…