Preemptive scheduling of equal-length jobs to maximize weighted throughput

Preemptive scheduling of equal-length jobs to maximize weighted throughput

We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the weighted throughput. In Graham's notation this problem is described as (1|r j;p j=p; pmtn|∑ w jU j) . We provide an O( n 4)-time algorithm, i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters 2004, Vol.32 (3), p.258-264
Hauptverfasser: Baptiste, Philippe, Chrobak, Marek, Dürr, Christoph, Jawor, Wojciech, Vakhania, Nodari
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Data Structures and Algorithms
Single machine preemptive scheduling
Weighted throughput
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the weighted throughput. In Graham's notation this problem is described as (1|r j;p j=p; pmtn|∑ w jU j) . We provide an O( n 4)-time algorithm, improving the previous bound of O( n 10).
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2003.09.004