A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective

We present a e/(e−1)-approximation algorithm for the nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on a single machine subject to release dates and precedence constraints. The previously best known approximation algorithm dates back to 1997; its performance...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 44; no. 5; pp. 676 - 679
Main Author Skutella, Martin
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.09.2016
Subjects
Approximation algorithm
LP relaxation
Machine scheduling
Precedence constraints
Total weighted completion time
Precedence constraints
Total weighted completion time
Machine scheduling
LP relaxation
Approximation algorithm
Online AccessGet full text
ISSN0167-6377
1872-7468
DOI10.1016/j.orl.2016.07.016

Cover

More Information
Summary:We present a e/(e−1)-approximation algorithm for the nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on a single machine subject to release dates and precedence constraints. The previously best known approximation algorithm dates back to 1997; its performance guarantee can be made arbitrarily close to the Euler constant  e  (Schulz and Skutella, 1997).
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2016.07.016