Minimizing Total Tardiness on One Machine is NP-Hard.
Jianzhong DuJoseph Y.-T. LeungPublished in: Math. Oper. Res. (1990)
Keyphrases
- linear program
- minimizing total tardiness
- scheduling problem
- np hard
- linear programming
- flowshop
- optimal solution
- single machine
- sequence dependent setup times
- special case
- setup times
- approximation algorithms
- np complete
- branch and bound algorithm
- tabu search
- lower bound
- precedence constraints
- worst case
- processing times
- integer programming
- constraint satisfaction problems
- parallel machines
- strongly np hard
- computational complexity
- knapsack problem
- identical parallel machines
- upper bound
- objective function