Scheduling jobs with position-dependent processing times (vol 55, pg 257, 2004)

被引：0

作者：

Janiak, A. ^{[1
]}

Kovalyov, M. Y. ^{[2
]}

机构：

[1] Wroclaw Univ Technol, PL-50370 Wroclaw, Poland

[2] Natl Acad Sci Belarus, United Inst Informat Problems, Minsk, BELARUS

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2012年 / 63卷 / 07期

关键词：

sequencing; single machine; learning effect; computational complexity;

D O I：

10.1057/jors.2012.18

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Bachman and Janiak provided a sketch of the proof that the problem 1 vertical bar r(i),(pi)(v) = a(i)/v vertical bar 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. Journal of the Operational Research Society (2012) 63, 1018-1020. doi: 10.1057/jors.2012.18 Published online 25 April 2012

引用

页码：1018 / 1020

页数：3