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

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters Vol. 26; no. 4; pp. 149 - 154
Main Authors: Goemans, Michel X., Wein, Joel M., Williamson, David P.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.05.2000
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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