1 research outputs found
General parametric scheme for the online uniform machine scheduling problem with two different speeds
International audienceIn this paper, we consider the online uniform machine scheduling problem on m processors when speed s i = 1 for i = k+1, ..., m and s i = s, s > 1, for i = 1, ..., k. The objective is to minimize makespan. We propose a parametric scheme with the worst-case performance 2.618 when 1 1 when the ratio m/k tends to infinity