Approximation scheduling algorithms: a survey

Approximation scheduling algorithms: a survey

The paper gives a state-of-art survey in the field of developing approximaion scheduling algorithms. Main attention is concentrated on algorithms with determined worst-case performance guarantees.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization 1989-01, Vol.20 (6), p.859-878
Hauptverfasser: Ya Kovalev, M, Shafranskij, Ya. M, Strusevich, V.A, Tanaev, V.S, Tuzikov, A.V
Format: Artikel
Sprache:eng
Schlagworte:
AMS 1980 Subject Classification
approximation algorithms
Primary: 90 B 35
Secondary: 90 B 02
Seheduling
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The paper gives a state-of-art survey in the field of developing approximaion scheduling algorithms. Main attention is concentrated on algorithms with determined worst-case performance guarantees.
ISSN:0233-1934
1029-4945
DOI:10.1080/02331938908843507