Online scheduling with one rearrangement at the end: Revisited

Yuxin Wang, Attila Benko, Xin Chen, G. Dósa, He Guo, Xin Han, Cecilia Sik Lanyi

Research output: Article

8 Citations (Scopus)

Abstract

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 2s+1)2s+2 for 1≤s≤2 and s+1s for 2

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

Fingerprint

Online Scheduling
Rearrangement
Scheduling
Scheduling Problem
Upper bound

ASJC Scopus subject areas

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

Cite this

Online scheduling with one rearrangement at the end : Revisited. / Wang, Yuxin; Benko, Attila; Chen, Xin; Dósa, G.; Guo, He; Han, Xin; Lanyi, Cecilia Sik.

In: Information Processing Letters, Vol. 112, No. 16, 31.08.2012, p. 641-645.

Research output: Article

Wang, Y, Benko, A, Chen, X, Dósa, G, Guo, H, Han, X & Lanyi, CS 2012, 'Online scheduling with one rearrangement at the end: Revisited', Information Processing Letters, vol. 112, no. 16, pp. 641-645. https://doi.org/10.1016/j.ipl.2012.05.009
Wang, Yuxin ; Benko, Attila ; Chen, Xin ; Dósa, G. ; Guo, He ; Han, Xin ; Lanyi, Cecilia Sik. / Online scheduling with one rearrangement at the end : Revisited. In: Information Processing Letters. 2012 ; Vol. 112, No. 16. pp. 641-645.
@article{24e30a0a964e4ac1ba99e0002fb7ac7f,
title = "Online scheduling with one rearrangement at the end: Revisited",
abstract = "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 2s+1)2s+2 for 1≤s≤2 and s+1s for 2",
keywords = "Competitive ratio, Online algorithms, Scheduling problems",
author = "Yuxin Wang and Attila Benko and Xin Chen and G. D{\'o}sa and He Guo and Xin Han and Lanyi, {Cecilia Sik}",
year = "2012",
month = "8",
day = "31",
doi = "10.1016/j.ipl.2012.05.009",
language = "English",
volume = "112",
pages = "641--645",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "16",

}

TY - JOUR

T1 - Online scheduling with one rearrangement at the end

T2 - Revisited

AU - Wang, Yuxin

AU - Benko, Attila

AU - Chen, Xin

AU - Dósa, G.

AU - Guo, He

AU - Han, Xin

AU - Lanyi, Cecilia Sik

PY - 2012/8/31

Y1 - 2012/8/31

N2 - 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 2s+1)2s+2 for 1≤s≤2 and s+1s for 2

AB - 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 2s+1)2s+2 for 1≤s≤2 and s+1s for 2

KW - Competitive ratio

KW - Online algorithms

KW - Scheduling problems

UR - http://www.scopus.com/inward/record.url?scp=84861871542&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861871542&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2012.05.009

DO - 10.1016/j.ipl.2012.05.009

M3 - Article

AN - SCOPUS:84861871542

VL - 112

SP - 641

EP - 645

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 16

ER -