Semi On-Line Scheduling on Two Uniform Machines

Zhi Yi TAN;Yong HE

Systems Engineering - Theory & Practice ›› 2001, Vol. 21 ›› Issue (2) : 53-57.

PDF(131 KB)
中国科学院数学与系统科学研究院期刊网
PDF(131 KB)
Systems Engineering - Theory & Practice ›› 2001, Vol. 21 ›› Issue (2) : 53-57. DOI: 10.12011/1000-6788(2001)2-53
论文

Semi On-Line Scheduling on Two Uniform Machines

  • Zhi Yi TAN,Yong HE
Author information +
History +

Abstract

This paper investigates two semi online scheduling problems on a two uniform machine system. In the first case, we assume that the total processing time is known in advance. In the second case, we assume that the largest processing time is known in advance. For each case we propose a heuristic and investigate its worst-case ratio.

Key words

Online scheduling / approximation algorithm / worst-case ratio

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
Zhi Yi TAN , Yong HE. Semi On-Line Scheduling on Two Uniform Machines. Systems Engineering - Theory & Practice, 2001, 21(2): 53-57 https://doi.org/10.12011/1000-6788(2001)2-53
PDF(131 KB)

521

Accesses

0

Citation

Detail
Sections
Recommended

/

〈 〉