Sushant Sachdeva, Rishi Saket: Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover. CCC 2013: 219-229