A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times

Radoslaw Rudek. A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times. Optimization Letters, 6(5):1021-1025, 2012. [doi]

Abstract

Abstract is missing.