A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Data Structures and Algorithms
2017-06-26 v1 Optimization and Control
Abstract
We give a -approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]
Keywords
Cite
@article{arxiv.1706.07604,
title = {A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective},
author = {René Sitters and Liya Yang},
journal= {arXiv preprint arXiv:1706.07604},
year = {2017}
}