On the Approximability of Single-Machine Scheduling with Precedence Constraints

Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola SvenssonMath. Oper. Res 2011 · DOI · OpenReview

Abstract

We consider the single-machine scheduling problem to minimize the weighted sum of completion times under precedence constraints. In a series of recent papers, it was established that this schedulin...
BibTeX
@article{ambuhl2011approximability,
  author = {Christoph Ambühl and Monaldo Mastrolilli and Nikolaus Mutsanas and Ola Svensson},
  title = {{On the Approximability of Single-Machine Scheduling with Precedence Constraints}},
  journal = {Math. Oper. Res.},
  year = {2011},
  doi = {10.1287/moor.1110.0512},
}

Loading related content...

Figure