# A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective

## TL;DR

This paper presents a $(2 + )$-approximation algorithm for single machine scheduling with precedence constraints and release dates, effectively addressing a recent conjecture in the field.

## Contribution

It introduces a novel approximation algorithm that achieves a $(2 + )$-approximation for the problem, settling a recent conjecture.

## Key findings

- Achieves a $(2 + )$-approximation ratio.
- Provides a new approach to scheduling with precedence constraints.
- Settles a recent open conjecture in the domain.

## Abstract

We give a $(2 + \epsilon)$-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]