| Titre : | Scheduling jobs with position-dependent processing times (2012) |
| Auteurs : | A. Janiak, Auteur ; M. Y. Kovalyov, Auteur |
| Type de document : | Article : texte imprimé |
| Dans : | Journal of the operational research society (JORS) (Vol. 63 N° 7, Juillet 2012) |
| Article en page(s) : | pp. 1018–1020 |
| Note générale : | Operational research |
| Langues : | Anglais |
| Index. décimale : | 001.424 |
| Tags : | Sequencing Single machine Learning effect Computational complexity |
| Résumé : | 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. |
| DEWEY : | 001.424 |
| ISSN : | 0160-5682 |
| En ligne : | http://www.palgrave-journals.com/jors/journal/v63/n7/abs/jors201218a.html |
