## On the Approximability of Single-Machine Scheduling with Precedence Constraints

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 scheduling problem is a special case of minimum weighted vertex cover.

Published in:
Mathematics Of Operations Research, 36, 653-669
Year:
2011
Keywords:
Laboratories: