A note on the complexity of scheduling problems with linear job deterioration

Jafari and Moslehi (J Glob Optim 54:389---404, 2012) state that certain single-machine scheduling problems with linear job deterioration are NP-hard. We show that this is not the case for the maximum lateness minimization problem and point out the issues in the analysis of Jafari and Moslehi (J Glob Optim 54:389---404, 2012).