On-Line Scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines

Abstract

A parallel related uniform machine system consists of m machines with different processing speeds. The speed of any machine is independent on jobs. In this paper, we consider online scheduling for jobs with arbitrary release times on the parallel uniform machine system. The jobs appear over list in terms of order. An order includes the processing size and releasing time of a job. For this model, an algorithm with competitive ratio of 12 is addressed in this paper.

Better Algorithm for Order On-Line Scheduling on Uniform Machines

“…Our task is to allocate an order sequence of jobs to m parallel uniform ma- worst case performance not bigger than 7.4641 is developed. The result is better than the existing result of 12 in Cheng et al [12].…”