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

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