A note on the precedence-constrained class sequencing problem

We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approximation algorithm with performance guarantee (c + 1)/2, where c is the number of colors. This improves upon Tovey’s c–approximation.

• Type: Journal
• Year: 2007
• Where: DAM
• Authors: José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses
• Keywords: Approximation Algorithm, DAM 2007, Scheduling Problem, Short Proof