Rudek, R. Optim Lett (2013) 7: 613. doi:10.1007/s11590-012-0445-0
In this paper, we show that the strong NP-hardness proof of the single machine makespan minimization problem with ready times and job processing times described by a non-increasing power function dependent on a job position in a sequence presented in Bachman and Janiak (J Oper Res Soc 55:257–264, 2004) is incorrect. Namely, the applied transformation from 3- Partition problem to the considered scheduling problem is polynomial not pseudopolynomial. Thus, the related problem is NP-hard, but it is not proved to be strongly NP-hard.
Computational analysisStrong NP-hardnessSchedulingLearning effectPosition-dependent processing time