A note on the paper ‘Single machine scheduling problems with financial resource constraints: Some complexity results and properties’ by E.R. Gafarov et al

Evgeny R. Gafarov, Alexander Lazarev and Frank Werner

Mathematical Social Sciences, 2013, vol. 65, issue 3, 232-232

Abstract: 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).

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489612001102
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:65:y:2013:i:3:p:232-232

DOI: 10.1016/j.mathsocsci.2012.11.004

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().