Scheduling with Precedence Constraints of Low Fractional Dimension

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

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• Vertex Cover in Graphs with Locally Few Colors
• 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?)
• Single machine precedence constrained scheduling is a Vertex cover problem
• An exact algorithm for the precedence-constrained single-machine scheduling problem

   Recommendations

• On the approximability of single-machine scheduling with precedence constraints 👍 👎
• On the approximability of average completion time scheduling under precedence constraints. 👍 👎
• Title not available (Why is that?) 👍 👎
• Approximating Precedence-Constrained Single Machine Scheduling by Coloring 👍 👎
• Title not available (Why is that?) 👍 👎

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)