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

Enrico Angelelli, Maria Grazia Speranza, Zsolt 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<1.4211 by a preprocessing strategy. The latter algorithm is only 2% away from the lower bound.

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

Keywords

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

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Semi on-line scheduling on three processors with known sum of the tasks'. Together they form a unique fingerprint.

  • Cite this