Online scheduling with rearrangement on two related machines

G. Dósa, Yuxin Wang, Xin Han, He Guo

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

In this paper, we consider an online non-preemptive scheduling problem on two related machines with rearrangement to minimize the completion time, called online scheduling with bounded rearrangement, which is a semi-online problem. Jobs arrive one by one over list. When a new job arrives at most K already scheduled jobs can be removed from the schedule, then all removed jobs and the new job must be assigned to the machines. The problem is a relaxation of the similar problem online scheduling with a buffer [4]. Assume machine M1 has speed 1 and M2 has speed s1.618 the lower bound is improved.

Original languageEnglish
Pages (from-to)642-653
Number of pages12
JournalTheoretical Computer Science
Volume412
Issue number8-10
DOIs
Publication statusPublished - Mar 4 2011

Fingerprint

Online Scheduling
Rearrangement
Scheduling
Completion Time
Buffer
Scheduling Problem
Schedule
Lower bound
Minimise

Keywords

  • Competitive analysis
  • Online algorithms
  • Scheduling problems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Online scheduling with rearrangement on two related machines. / Dósa, G.; Wang, Yuxin; Han, Xin; Guo, He.

In: Theoretical Computer Science, Vol. 412, No. 8-10, 04.03.2011, p. 642-653.

Research output: Contribution to journalArticle

Dósa, G. ; Wang, Yuxin ; Han, Xin ; Guo, He. / Online scheduling with rearrangement on two related machines. In: Theoretical Computer Science. 2011 ; Vol. 412, No. 8-10. pp. 642-653.
@article{1870c8ed7050487aa181ce26ee819ae6,
title = "Online scheduling with rearrangement on two related machines",
abstract = "In this paper, we consider an online non-preemptive scheduling problem on two related machines with rearrangement to minimize the completion time, called online scheduling with bounded rearrangement, which is a semi-online problem. Jobs arrive one by one over list. When a new job arrives at most K already scheduled jobs can be removed from the schedule, then all removed jobs and the new job must be assigned to the machines. The problem is a relaxation of the similar problem online scheduling with a buffer [4]. Assume machine M1 has speed 1 and M2 has speed s1.618 the lower bound is improved.",
keywords = "Competitive analysis, Online algorithms, Scheduling problems",
author = "G. D{\'o}sa and Yuxin Wang and Xin Han and He Guo",
year = "2011",
month = "3",
day = "4",
doi = "10.1016/j.tcs.2010.10.019",
language = "English",
volume = "412",
pages = "642--653",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "8-10",

}

TY - JOUR

T1 - Online scheduling with rearrangement on two related machines

AU - Dósa, G.

AU - Wang, Yuxin

AU - Han, Xin

AU - Guo, He

PY - 2011/3/4

Y1 - 2011/3/4

N2 - In this paper, we consider an online non-preemptive scheduling problem on two related machines with rearrangement to minimize the completion time, called online scheduling with bounded rearrangement, which is a semi-online problem. Jobs arrive one by one over list. When a new job arrives at most K already scheduled jobs can be removed from the schedule, then all removed jobs and the new job must be assigned to the machines. The problem is a relaxation of the similar problem online scheduling with a buffer [4]. Assume machine M1 has speed 1 and M2 has speed s1.618 the lower bound is improved.

AB - In this paper, we consider an online non-preemptive scheduling problem on two related machines with rearrangement to minimize the completion time, called online scheduling with bounded rearrangement, which is a semi-online problem. Jobs arrive one by one over list. When a new job arrives at most K already scheduled jobs can be removed from the schedule, then all removed jobs and the new job must be assigned to the machines. The problem is a relaxation of the similar problem online scheduling with a buffer [4]. Assume machine M1 has speed 1 and M2 has speed s1.618 the lower bound is improved.

KW - Competitive analysis

KW - Online algorithms

KW - Scheduling problems

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

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

U2 - 10.1016/j.tcs.2010.10.019

DO - 10.1016/j.tcs.2010.10.019

M3 - Article

AN - SCOPUS:79151483727

VL - 412

SP - 642

EP - 653

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 8-10

ER -