Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic

Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic

In the paper a power-aware problem of scheduling preemptable jobs on parallel identical machines to minimize the schedule length is considered. Exact approaches utilizing the idea of grouping jobs are presented and compared from the viewpoint of the size of an appropriate non-linear programming prob...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2015-02, Vol.182, p.150-161
Hauptverfasser: Rozycki, Rafal, Weglarz, Jan
Format: Artikel
Sprache:eng
Schlagworte:
Doubly constrained resource
Mathematical analysis
Modeling computational jobs
Nonlinearity
Power-aware scheduling
Programming
Schedules
Scheduling
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the paper a power-aware problem of scheduling preemptable jobs on parallel identical machines to minimize the schedule length is considered. Exact approaches utilizing the idea of grouping jobs are presented and compared from the viewpoint of the size of an appropriate non-linear programming problem.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2013.11.003