| Article ID: | iaor201526133 |
| Volume: | 62 |
| Issue: | 2 |
| Start Page Number: | 409 |
| End Page Number: | 410 |
| Publication Date: | Jun 2015 |
| Journal: | Journal of Global Optimization |
| Authors: | Koulamas Christos, Panwalkar S |
| Keywords: | scheduling, combinatorial optimization |
Jafari and Moslehi (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.