A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time Objective
Discrete Mathematics
2016-04-25 v2 Optimization and Control
Abstract
We present a -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 .
Keywords
Cite
@article{arxiv.1603.04690,
title = {A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time Objective},
author = {Martin Skutella},
journal= {arXiv preprint arXiv:1603.04690},
year = {2016}
}