Online scheduling of unit jobs on three machines with rejection: A tight result

Leah Epstein, Hanan Zebedat-Haider

Research output: Contribution to journalArticlepeer-review

Abstract

We design an algorithm of the best possible competitive ratio for preemptive and non-preemptive scheduling of unit size jobs with rejection on three identical machines. The algorithm does not use preemption even for the preemptive variant, and it has the interesting feature that one of its parameters is not fixed in advance, and it is defined based on the properties of the first input job having a sufficiently large rejection penalty.

Original languageEnglish
Pages (from-to)252-255
Number of pages4
JournalInformation Processing Letters
Volume116
Issue number3
DOIs
StatePublished - Mar 2016

Bibliographical note

Publisher Copyright:
© 2015 Elsevier B.V.

Keywords

  • Competitive ratio
  • On-line algorithms
  • Scheduling

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Online scheduling of unit jobs on three machines with rejection: A tight result'. Together they form a unique fingerprint.

Cite this