Unary NP-hardness of minimizing the number of tardy jobs with deadlines.
Jinjiang YuanPublished in: J. Sched. (2017)
Keyphrases
- np hardness
- number of tardy jobs
- single machine
- processing times
- single machine scheduling problem
- np hard
- scheduling problem
- flowshop
- approximation algorithms
- branch and bound algorithm
- pairwise
- mixed integer
- resource consumption
- special case
- precedence constraints
- response time
- optimal solution
- lagrangian relaxation
- knapsack problem
- tabu search
- multi agent
- linear programming
- dynamic programming
- search algorithm
- cost function