TITLE:
Ordinal Semi On-Line Scheduling for Jobs with Arbitrary Release Times on Identical Parallel Machines
AUTHORS:
Sai Ji, Rongheng Li, Yunxia Zhou
KEYWORDS:
Schedule, Algorithm, Worst Case Ratio, Parallel Machines
JOURNAL NAME:
Intelligent Information Management,
Vol.9 No.6,
November
15,
2017
ABSTRACT: In this paper, we investigate the problem of semi-on-line scheduling n jobs on m identical parallel machines under the assumption that the ordering of the jobs by processing time is known and the jobs have arbitrary release times. Our aim is to minimize the maximum completion time. An ordinal algorithm is investigated and its worst case ratio is analyzed.