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 language | English |
---|---|
Pages (from-to) | 252-255 |
Number of pages | 4 |
Journal | Information Processing Letters |
Volume | 116 |
Issue number | 3 |
DOIs | |
State | Published - 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