Online scheduling with reassignment on two uniform machines

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 is optimal for , where s is the speed ratio between the two machines. Also, we prove the lower bound for and design an algorithm that matches the bound.