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

作者：Koulamas Christos^*; Panwalkar S S

来源：Journal of Global Optimization, 2015, 62(2): 409-410.

DOI：10.1007/s10898-014-0254-3

• Scheduling
• Single-machine
• 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).

• 出版日期2015-6