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

Christos Koulamas () and S. Panwalkar ()

Journal of Global Optimization, 2015, vol. 62, issue 2, 409-410

Abstract: 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 ). Copyright Springer Science+Business Media New York 2015

Keywords: Scheduling; Single-machine; Job deterioration (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-014-0254-3 (text/html)
Access to full text is restricted to subscribers.

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:spr:jglopt:v:62:y:2015:i:2:p:409-410

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-014-0254-3

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().