Semi on-line scheduling on three processors with known sum of the tasks

Enrico Angelelli, Maria Grazia Speranza, Z. Tuza

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We consider a semi on-line version of the multiprocessor scheduling problem on three processors, where the total size of the tasks is known in advance. We prove a lower bound 1+ √129-9/6>1.3929 on the competitive ratio of any algorithm and propose a simple algorithm with competitive ratio equal to 1.5. The performance is improved to 1+8/19

Original languageEnglish
Pages (from-to)263-269
Number of pages7
JournalJournal of Scheduling
Volume10
Issue number4-5
DOIs
Publication statusPublished - Oct 2007

Fingerprint

Scheduling
Competitive ratio
Lower bounds

Keywords

  • Competitive analysis
  • Parallel processors
  • Semi on-line scheduling

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

Semi on-line scheduling on three processors with known sum of the tasks. / Angelelli, Enrico; Speranza, Maria Grazia; Tuza, Z.

In: Journal of Scheduling, Vol. 10, No. 4-5, 10.2007, p. 263-269.

Research output: Contribution to journalArticle

Angelelli, Enrico ; Speranza, Maria Grazia ; Tuza, Z. / Semi on-line scheduling on three processors with known sum of the tasks. In: Journal of Scheduling. 2007 ; Vol. 10, No. 4-5. pp. 263-269.
@article{00aaa0b3f56d4831bc5600f29ed4bb7f,
title = "Semi on-line scheduling on three processors with known sum of the tasks",
abstract = "We consider a semi on-line version of the multiprocessor scheduling problem on three processors, where the total size of the tasks is known in advance. We prove a lower bound 1+ √129-9/6>1.3929 on the competitive ratio of any algorithm and propose a simple algorithm with competitive ratio equal to 1.5. The performance is improved to 1+8/19",
keywords = "Competitive analysis, Parallel processors, Semi on-line scheduling",
author = "Enrico Angelelli and Speranza, {Maria Grazia} and Z. Tuza",
year = "2007",
month = "10",
doi = "10.1007/s10951-007-0023-y",
language = "English",
volume = "10",
pages = "263--269",
journal = "Journal of Scheduling",
issn = "1094-6136",
publisher = "Springer New York",
number = "4-5",

}

TY - JOUR

T1 - Semi on-line scheduling on three processors with known sum of the tasks

AU - Angelelli, Enrico

AU - Speranza, Maria Grazia

AU - Tuza, Z.

PY - 2007/10

Y1 - 2007/10

N2 - We consider a semi on-line version of the multiprocessor scheduling problem on three processors, where the total size of the tasks is known in advance. We prove a lower bound 1+ √129-9/6>1.3929 on the competitive ratio of any algorithm and propose a simple algorithm with competitive ratio equal to 1.5. The performance is improved to 1+8/19

AB - We consider a semi on-line version of the multiprocessor scheduling problem on three processors, where the total size of the tasks is known in advance. We prove a lower bound 1+ √129-9/6>1.3929 on the competitive ratio of any algorithm and propose a simple algorithm with competitive ratio equal to 1.5. The performance is improved to 1+8/19

KW - Competitive analysis

KW - Parallel processors

KW - Semi on-line scheduling

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

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

U2 - 10.1007/s10951-007-0023-y

DO - 10.1007/s10951-007-0023-y

M3 - Article

VL - 10

SP - 263

EP - 269

JO - Journal of Scheduling

JF - Journal of Scheduling

SN - 1094-6136

IS - 4-5

ER -