Online minimum makespan scheduling with a buffer

  • Authors:

  • Yan Lan;Xin Chen;Ning Ding;György Dósa;Xin Han

  • Affiliations:

  • Dalian Neusoft Institute of Information, China;Software School, Dalian University of Technology, China;Software School, Dalian University of Technology, China;Department of Mathematics, University of Pannonia, Veszprém, Hungary;Software School, Dalian University of Technology, China

  • Venue:
  • FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results, which improve on work from FOCS 2008: i) for m identical machines, we give a 1.5-competitive online algorithm with a buffer of size 1.5m , which is better than the previous best result : 1.5-competitive algorithm with a buffer of size 1.6197m ; ii) for three identical machines, to give an optimal online algorithm we reduce the size of the buffer from nine to six; iii) for m uniform machines, using a buffer of size m , we improve the competitive ratio from 2+ε to 2−1/m +ε , where ε 0 is sufficiently small.