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

DOI10.1016/j.orl.2018.05.007zbMath1525.90221arXiv1706.07604MaRDI QIDQ6288210

R. A. Sitters, Li-Ya Yang

Publication date: 23 June 2017

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

This page was built for publication: A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective