A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times.
Radoslaw RudekPublished in: Optim. Lett. (2012)
Keyphrases
- np hardness
- scheduling problem
- np hard
- job processing times
- flowshop
- single machine
- makespan minimization
- release dates
- processing times
- approximation algorithms
- special case
- polynomially solvable
- tabu search
- precedence constraints
- total weighted tardiness
- worst case
- setup times
- lower bound
- job shop scheduling
- np complete
- integer programming
- parallel machines
- branch and bound algorithm
- linear programming
- job shop scheduling problem
- optimal solution
- computational complexity
- linear program
- constraint satisfaction problems
- sequence dependent setup times
- job shop
- knapsack problem
- single machine scheduling problem
- supply chain