Min-sum scheduling under precedence constraints

DOI10.4230/LIPICS.ESA.2016.74zbMATH Open1397.90191OpenAlexW2529699293MaRDI QIDQ4606348FDOQ4606348

José Verschae, Andreas S. Schulz

Publication date: 2 March 2018

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2016.74

Recommendations

• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• scientific article; zbMATH DE number 2102785
• On the approximability of average completion time scheduling under precedence constraints.
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• scientific article; zbMATH DE number 1754642

zbMATH Keywords

approximation algorithmsschedulingprecedence constraintslinear programming relaxations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cited In (4)

• Designing PTASs for MIN-SUM scheduling problems
• A note on scheduling to meet two min-sum objectives
• Effective iterative algorithms in scheduling theory
• On Submodular Search and Machine Scheduling

This page was built for publication: Min-sum scheduling under precedence constraints

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