Scheduling jobs with position-dependent processing times

A Janiak and M Y Kovalyov
Additional contact information
A Janiak: Wroclaw University of Technology, Wroclaw, Poland
M Y Kovalyov: Wroclaw University of Technology, Wroclaw, Poland

Journal of the Operational Research Society, 2012, vol. 63, issue 7, 1018-1020

Abstract: Bachman and Janiak provided a sketch of the proof that the problem 1∣ri(v)=ai is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof.

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v63/n7/pdf/jors201218a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v63/n7/full/jors201218a.html Link to full text HTML (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:pal:jorsoc:v:63:y:2012:i:7:p:1018-1020

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

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().