Precedence-constrained scheduling and min-sum set cover (extended Abstract)

DOI10.1007/978-3-030-39479-0_12OpenAlexW3004200571MaRDI QIDQ2193091

Andreas S. Schulz, Felix Happach

Publication date: 24 August 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39479-0_12

zbMATH Keywords

schedulingprecedence constraintsmin-sum set cover

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

A General Framework for Approximating Min Sum Ordering Problems

This page was built for publication: Precedence-constrained scheduling and min-sum set cover (extended Abstract)