//-->
An optimal rounding gives a better approximation for scheduling unrelated machines
Shchepin, Evgeny V., (2005)
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V., (2008)
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V., (2011)