Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover | IEEE Conference Publication | IEEE Xplore