Better Algorithm for Order On-Line Scheduling on Uniform Machines - International Journal of Intelligence Science

IJIS > Vol.9 No.2, April 2019

Better Algorithm for Order On-Line Scheduling on Uniform Machines ()

HTML XML

Download as PDF (Size: 294KB) PP. 59-65

DOI: 10.4236/ijis.2019.92004 401 Downloads 897 Views

Author(s)

Rongheng Li¹, Yunxia Zhou²

Affiliation(s)

¹Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education), School of Mathematics and Statistics, Department of Mathematics, Hunan Normal University, Changsha, China.
²Department of Computer, Hunan Normal University, Changsha, China.

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.

KEYWORDS

Online Scheduling, Uniform Machine, Competitive Ratio, LS Algorithm

Share and Cite:

Li, R. and Zhou, Y. (2019) Better Algorithm for Order On-Line Scheduling on Uniform Machines. International Journal of Intelligence Science, 9, 59-65. doi: 10.4236/ijis.2019.92004.

Journals Menu