Better Algorithm for Order On-Line Scheduling on Uniform Machines

HTML  XML Download Download as PDF (Size: 294KB)  PP. 59-65  
DOI: 10.4236/ijis.2019.92004    401 Downloads   896 Views  
Author(s)

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.

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.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.