Erratum: Scheduling jobs with position-dependent processing times

Abstract

Bachman and Janiak provided a sketch of the proof that the problem 1∣r_i,p_i(v)=a_i/v∣C_max 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.

Keywords:

• sequencing
• single machine
• learning effect
• computational complexity

This article refers to:

Scheduling jobs with position-dependent processing times

The online version of the original article can be found at 10.1057/palgrave.jors.2601689

The online version of the original article can be found at 10.1057/palgrave.jors.2601689