Scheduling jobs with position‐dependent processing times

0.00 Avg rating—0 Votes

Article ID:	iaor20124337
Volume:	63
Issue:	7
Start Page Number:	1018
End Page Number:	1020
Publication Date:	Jul 2012
Journal:	Journal of the Operational Research Society
Authors:	Janiak A, Kovalyov M Y
Keywords:	combinatorial optimization

Abstract:

Bachman and Janiak provided a sketch of the proof that the problem 1∣ri,pi(v)=ai/v∣Cmax 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.

Reviews

Required fields are marked *. Your email address will not be published.