Scheduling with Precedence Constraints of Low Fractional Dimension

DOI10.1007/978-3-540-72792-7_11zbMATH Open1136.90347OpenAlexW2163626560MaRDI QIDQ5429263FDOQ5429263

Authors: Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson, Christoph Ambühl 

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_11

Recommendations

• On the approximability of single-machine scheduling with precedence constraints
• On the approximability of average completion time scheduling under precedence constraints.
• scientific article; zbMATH DE number 1754642
• Approximating Precedence-Constrained Single Machine Scheduling by Coloring
• scientific article

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cited In (12)

• Approximating Precedence-Constrained Single Machine Scheduling by Coloring
• Single Machine Scheduling with Precedence Constraints of Dimension 2
• Title not available (Why is that?)
• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
• Quasi-PTAS for scheduling with precedences using LP hierarchies
• Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
• On the approximability of average completion time scheduling under precedence constraints.
• Title not available (Why is that?)
• On the approximability of single-machine scheduling with precedence constraints
• Single machine precedence constrained scheduling is a Vertex cover problem
• Vertex cover in graphs with locally few colors
• An exact algorithm for the precedence-constrained single-machine scheduling problem

This page was built for publication: Scheduling with Precedence Constraints of Low Fractional Dimension

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