A 1.47-approximation algorithm for a preemptive single-machine scheduling problem

In this note, we give a 1.47-approximation algorithm for the preemptive scheduling of jobs with release dates on a single machine so as to minimize the weighted sum of job completion times; this problem is denoted by 1| r j , pmtn|∑ j w j C j in the notation of Lawler et al. (Handbooks in Operations...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Operations research letters Jg. 26; H. 4; S. 149 - 154
Hauptverfasser:	Goemans, Michel X., Wein, Joel M., Williamson, David P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.05.2000
Schlagworte:	Analysis of algorithms Approximations/heuristic Production/scheduling Single-machine deterministic scheduling Suboptimal algorithms Suboptimal algorithms Production/scheduling Approximations/heuristic Analysis of algorithms Single-machine deterministic scheduling
ISSN:	0167-6377, 1872-7468
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!