Scheduling with Precedence Constraints of Low Fractional Dimension

DOI10.1007/978-3-540-72792-7_11zbMath1136.90347OpenAlexW2163626560MaRDI QIDQ5429263

Nikolaus Mutsanas, Monaldo Mastrolilli, 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

Mathematics Subject Classification ID

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

Related Items (4)

Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets ⋮ Vertex Cover in Graphs with Locally Few Colors ⋮ Single machine precedence constrained scheduling is a Vertex cover problem ⋮ 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