On the relationship between combinatorial and LP-based lower bounds to NP-hard scheduling problems.

Publication
Theoretical Computer Science 361:241-256, 2006.