Distributions with a heavy tail are difficult to estimate. If the design of an optimal scheduling policy is sensitive to the details of heavy tail distributions of the service times, an approximately optimal solution is difficult to obtain. This paper shows that the mean optimal scheduling of an M/G/1 queue with heavy tailed service times does not present this difficulty and that an approximately optimal strategy can be derived by truncating the distributions.
机构:
US AF Headquarters Manpower & Personnel, Directorate Force Management Policy, Washington, DC 20330 USAUS AF Headquarters Manpower & Personnel, Directorate Force Management Policy, Washington, DC 20330 USA
Sherman, Nathan P.
Kharoufeh, Jeffrey P.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Pittsburgh, Dept Ind Engn, Pittsburgh, PA 15261 USAUS AF Headquarters Manpower & Personnel, Directorate Force Management Policy, Washington, DC 20330 USA
机构:
Univ Carlos III Madrid, Fac Ciencias Sociales & Juridicas, Dept Estadistica & Econometria, Madrid 28903, SpainUniv Carlos III Madrid, Fac Ciencias Sociales & Juridicas, Dept Estadistica & Econometria, Madrid 28903, Spain