This note emends an incorrectness in the NP-hardness proof of problem 1|NR,dj=d,gj=g|∑Tj given in a paper by Gafarov et al. in Mathematical Social Sciences (see vol. 62, 2011, 7–13).

We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness,...