Some optimal inapproximability results
Convex quadratic and semidefinite programming relaxations in scheduling