Simple approximation algorithms for minimizing the total weighted completion time of precedence-constrained jobs

DOI10.1137/1.9781611977936.8MaRDI QIDQ6545105zbMATH OpenFDO

Authors Sven Jäger, Philipp Warode

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977936.8

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• The power of proportional fairness for nonclairvoyant polytope scheduling

This page was built for publication: Simple approximation algorithms for minimizing the total weighted completion time of precedence-constrained jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545105)