Scheduling jobs with position-dependent processing times

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.

MoreLess

Year of publication:	2012
Authors:	Janiak, A ; Kovalyov, M Y
Published in:	Journal of the Operational Research Society. - Palgrave Macmillan, ISSN 0160-5682. - Vol. 63.2012, 7, p. 1018-1020
Publisher:	Palgrave Macmillan

More details

Extent:	application/pdf text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010550990