Title of article
A note on the precedence-constrained class sequencing problem
Author/Authors
José R. Correa، نويسنده , , Samuel Fiorini، نويسنده , , Nicol?s E. Stier-Moses، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
3
From page
257
To page
259
Abstract
We give a short proof of a result of Tovey [Non-approximability of precedence-constrained sequencing to minimize setups, Discrete Appl. Math. 134:351–360, 2004] on the inapproximability of a scheduling problem known as precedence-constrained class sequencing. In addition, we present an approximation algorithm with performance guarantee image, where c is the number of colors. This improves upon Toveyʹs c-approximation.
Keywords
Precedence-constrained scheduling , Hardness of approximation , Approximation algorithms
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886413
Link To Document