Cím: Online scheduling with one rearrangement at the end: revisited
Szerzők: Yuxin Wang, Attila Benkő, Xin Chen, György Dósa, He Guo, Xin Han, Cecilia Sik Lanyi
2012 august 31.
Absztrakt: In this paper, we consider an online non-preemptive scheduling problem
on two related machines, with only one rearrangement at the end, called Online scheduling with one rearrangement at the end. We proposed an improved algorithm for 1 ≤ s ≤ 2, where s is the speed ratio between the fast machine and slow machine. The upper bounds are
2(s+1)/(s+2) for 1 ≤ s ≤ 1.414, and (s+2)/(s+1) for 1.414 < s ≤ 2, which are better than previous results.