A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times.
Radoslaw RudekPublished in: Optim. Lett. (2013)
Keyphrases
- np hardness
- scheduling problem
- np hard
- job processing times
- flowshop
- single machine
- makespan minimization
- release dates
- processing times
- approximation algorithms
- polynomially solvable
- np complete
- polynomial time approximation
- optimal solution
- parallel machines
- special case
- lower bound
- tabu search
- precedence constraints
- total weighted tardiness
- job shop
- setup times
- worst case
- decision problems
- linear programming
- integer programming
- sequence dependent setup times
- mixed integer
- knapsack problem
- linear program
- job shop scheduling problem
- computational complexity
- single machine scheduling problem
- lagrangian relaxation
- vehicle routing problem