Similar Search Results

Comment on ‘the strong NP-completeness of 3-PARTITION problem with Bkm’ by Zhongyi Jiang, Fangfang Chen, Chunqing Wu

Janiak, A; Lichtenstein, M; Kovalyov, M Y - In: Journal of the Operational Research Society 64 (2013) 5, pp. 787-787

Persistent link: https://www.econbiz.de/10010633874

Scheduling jobs with position-dependent processing times

Janiak, A; Kovalyov, M Y - In: Journal of the Operational Research Society 63 (2012) 7, pp. 1018-1020

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

Persistent link: https://www.econbiz.de/10010550990

Scheduling jobs with position-dependent processing times

Janiak, A; Kovalyov, M Y - In: Journal of the Operational Research Society : OR 63 (2012) 7, pp. 1018-1021

Persistent link: https://www.econbiz.de/10009979516

Scheduling jobs under an aging effect

Janiak, A; Rudek, R - In: Journal of the Operational Research Society : OR 61 (2010) 6, pp. 1041-1049

Persistent link: https://www.econbiz.de/10008410426

Scheduling jobs under an aging effect

Janiak, A; Rudek, R - In: Operations research, Management science : OR MS ; the … 52 (2012) 3, pp. 229-231

Persistent link: https://www.econbiz.de/10009986593