M. F. M. Nuyens

Learn More
In this article we study the maximum queue length M in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy tailed) service time distributions the Foreground Background service discipline is optimal. This discipline gives service to those customer(s) that have received the least amount of service so far.(More)
In this paper we study the maximum queue length M (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions the Foreground Background service discipline is optimal. This discipline gives service to the customer(s) that have(More)
  • 1