arXiv
Open Access
2017
A $(2 + ε)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
René Sitters
Liya Yang
Abstrak
We give a $(2 + ε)$-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]
Penulis (2)
R
René Sitters
L
Liya Yang
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2017
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓