Min-sum scheduling under precedence constraints

DOI10.4230/LIPICS.ESA.2016.74MaRDI QIDQ4606348zbMATH OpenOpenAlexFDO

Authors Andreas S. Schulz, José Verschae

Publication date 2 March 2018

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

zbMATH Keywords

approximation algorithmslinear programming relaxationsprecedence constraintsscheduling

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Precedence-constrained scheduling and min-sum set cover (extended Abstract)
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
• Designing PTASs for MIN-SUM scheduling problems
• A note on scheduling to meet two min-sum objectives
• Effective iterative algorithms in scheduling theory
• Non-Clairvoyant Precedence Constrained Scheduling.
• 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)