Online scheduling with one rearrangement at the end: Revisited

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 (OSORE  ). We proposed an improved algorithm for 1⩽s⩽21⩽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⩽2 and s+2s+1 for 2

► Online scheduling problem on two related machines with only one rearrangement at the end.
► An improved online algorithm for s   in [1,2][1,2].
► The competitive ratio of the algorithm is 2(s+1)/(s+2)2(s+1)/(s+2) for 1⩽s⩽1.4141⩽s⩽1.414.
► The competitive ratio of the algorithm is (s+2)/(s+1)(s+2)/(s+1) for 1.414