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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Operations research letters Ročník 26; číslo 4; s. 149 - 154
Hlavní autori:	Goemans, Michel X., Wein, Joel M., Williamson, David P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.05.2000
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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 Research and Management Science, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, pp. 445-522). Our result improves on a 2-approximation algorithm due to Hall et al. Math. Oper. Res. 22 (1997) 513–544, and also yields an improved bound on the quality of a well-known linear programming relaxation of the problem.
ISSN:	0167-6377 1872-7468
DOI:	10.1016/S0167-6377(00)00024-9