Communication: A note on the precedence-constrained class sequencing problem

Authors:
José R. Correa;Samuel Fiorini;Nicolás E. Stier-Moses
Affiliations:
School of Business, Universidad Adolfo Ibáñez, Santiago, Chile;Department of Mathematics, Université Libre de Bruxelles, Brussels, Belgium;Graduate School of Business, Columbia University, New York, USA
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 5
Cited 0

Routing printed circuit cards through an assembly cell

Operations Research
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

SIAM Journal on Computing
On the complexity of loop fusion

Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Non-approximability of precedence-constrained sequencing to minimize setups

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

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 (c+1)/2, where c is the number of colors. This improves upon Tovey's c-approximation.