Better Algorithm for Order On-Line Scheduling on Uniform Machines

Abstract

In this paper, we consider online scheduling for jobs with arbitrary release times on the parallel uniform machine system. An algorithm with competitive ratio of 7.4641 is addressed, which is better than the best existing result of 12.