Multilevel Procesor Sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the Processor Sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing
