Author(s)

Xiayan Cheng¹, Rongheng Li², Yunxia Zhou³

¹Department of Mathematics, Hunan First Normal University, Changsha, China.
²Department of Mathematics, Key Laboratory of High Performance Computing and Stochastic Information Processing, Hunan Normal University, Changsha, China.
³Department of Computer, Hunan Normal University, Changsha, China.

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.

Online Scheduling, Uniform Machine, Competitive Ratio, Approximation Algorithm

Cheng, X. , Li, R. and Zhou, Y. (2016) On-Line Scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines. Intelligent Information Management, 8, 98-102. doi: 10.4236/iim.2016.84008.