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

DOI10.1007/978-3-030-39479-0_12MaRDI QIDQ2193091zbMATH OpenOpenAlexFDO

Authors Felix Happach, Andreas S. Schulz

Publication date 24 August 2020

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

zbMATH Keywords

min-sum set coverprecedence constraintsscheduling

Mathematics Subject Classification ID

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

Recommendations

• Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover
• On the approximability of single-machine scheduling with precedence constraints
• Min-sum scheduling under precedence constraints
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Preemptive and non-preemptive generalized min sum set cover

Cited in

(4)

• A General Framework for Approximating Min Sum Ordering Problems
• Precedence-Constrained Min Sum Set Cover
• scientific article; zbMATH DE number 5260973 (Why is no real title available?)
• Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover

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

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