direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

Approximating Total Weighted Completion Time on Identical Parallel Machines with Precedence Constraints and Release Dates
Zitatschlüssel Jaeger2018
Autor Jäger, Sven
Seiten 505–509
Jahr 2018
ISSN 0167-6377
DOI 10.1016/j.orl.2018.07.006
Journal Operations Research Letters
Jahrgang 46
Nummer 5
Monat September
Zusammenfassung We present a (2+2 ln 2 + ε)-approximation algorithm for the classical nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on identical parallel machines subject to release dates and precedence constraints, improving upon the previously best known 4-approximation algorithm from 1998. The result carries over to the more general problem with precedence delays and generalizes a recent result by Li (2017) for the problem without release dates or delays.
Link zur Originalpublikation Download Bibtex Eintrag

Zusatzinformationen / Extras