Approximating Precedence-Constrained Single Machine Scheduling by Coloring
From MaRDI portal
Publication:3595374
DOI10.1007/11830924_4zbMath1155.90373OpenAlexW1496117300MaRDI QIDQ3595374
Monaldo Mastrolilli, Ola Svensson, Christoph Ambühl
Publication date: 28 August 2007
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11830924_4
Related Items (5)
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ Cross-series-parallel digraphs ⋮ 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: Approximating Precedence-Constrained Single Machine Scheduling by Coloring