A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times

Radoslaw Rudek. A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times. Optimization Letters, 7(3):613-616, 2013. [doi]

Abstract

Abstract is missing.