A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times

DOI10.1007/s11590-012-0445-0zbMath1268.90021OpenAlexW2042016438MaRDI QIDQ1941204

Radosław Rudek

Publication date: 12 March 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0445-0

zbMATH Keywords

schedulingstrong NP-hardnesslearning effectcomputational analysisposition-dependent processing time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On single processor scheduling problems with learning dependent on the number of processed jobs

Cites Work

• New results on the least common multiple of consecutive integers
• Scheduling jobs with position-dependent processing times
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times