Erratum: Scheduling jobs with position-dependent processing times |
| |
| Authors: | A Janiak M Y Kovalyov |
| |
| Affiliation: | 1.Wroclaw University of Technology,Wroclaw,Poland;2.United Institute of Informatics Problems, National Academy of Sciences of Belarus,Minsk,Belarus |
| |
| Abstract: | ![]()
Bachman and Janiak provided a sketch of the proof that the problem 1∣r i ,p i (v)=a i /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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
