Online scheduling with one rearrangement at the end: Revisited

Yuxin Wang, Attila Benko, Xin Chen, György Dósa, He Guo, Xin Han, Cecilia Sik Lanyi

Research output: Contribution to journalArticle

8 Citations (Scopus)


In this paper, we consider an online non-preemptive scheduling problem on two related machines, with only one rearrangement at the end, called Online scheduling with one rearrangement at the end (OSORE). We proposed an improved algorithm for 1≤s≤2, where s is the speed ratio between the fast machine and slow machine. The upper bounds are 2(s+1)s+2 for 1≤s≤2 and s+2s+1 for 2<s≤2, which are better than previous results, i.e. ( s+1)2s+2 for 1≤s≤2 and s+1s for 2<s≤2 (Liu et al., 2009 [7]).

Original languageEnglish
Pages (from-to)641-645
Number of pages5
JournalInformation Processing Letters
Issue number16
Publication statusPublished - Aug 31 2012


  • Competitive ratio
  • Online algorithms
  • Scheduling problems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Online scheduling with one rearrangement at the end: Revisited'. Together they form a unique fingerprint.

  • Cite this