A note on the paper ‘Single machine scheduling problems with financial resource constraints: Some complexity results and properties’ by E.R. Gafarov et al.
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).
Year of publication: |
2013
|
---|---|
Authors: | Gafarov, Evgeny R. ; Lazarev, Alexander A. ; Werner, Frank |
Published in: |
Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 65.2013, 3, p. 232-232
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Gafarov, Evgeny R., (2011)
-
Single machine total tardiness maximization problems: complexity and algorithms
Gafarov, Evgeny R., (2013)
-
Gafarov, Evgeny R., (2012)
- More ...