Article citationsMore>>

Tan, Z.Y. and He, Y. (2001) Semi Online Scheduling with Ordinal Data on Two Uniform Machines. Operations Research Letters, 28, 221-231.
https://doi.org/10.1016/S0167-6377(01)00071-2

has been cited by the following article:

• 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.