TITLE:
On-Line Scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines
AUTHORS:
Xiayan Cheng, Rongheng Li, Yunxia Zhou
KEYWORDS:
Online Scheduling, Uniform Machine, Competitive Ratio, Approximation Algorithm
JOURNAL NAME:
Intelligent Information Management,
Vol.8 No.4,
July
25,
2016
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.