A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times

DOI10.1007/S11590-011-0330-2zbMath1269.90146OpenAlexW2064442462MaRDI QIDQ1758042

Radosław Rudek

Publication date: 7 November 2012

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

Full work available at URL: https://doi.org/10.1007/s11590-011-0330-2

zbMATH Keywords

schedulingdeteriorating jobsmakespancomplexity theory

Mathematics Subject Classification ID

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

Cites Work

• A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times