Online scheduling with reassignment on two uniform machines

  • Authors:

  • Qian Cao;Zhaohui Liu

  • Affiliations:

  • Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China;Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2010

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper, we investigate the online scheduling problem on two uniform machines, where the last job of each machine can be reassigned after all jobs have been assigned. The objective is to minimize the makespan. We prove that the classical List Scheduling algorithm with the competitive ratio s+1s is optimal for s=1+52, where s is the speed ratio between the two machines. Also, we prove the lower bound s+1 for 1@?s