Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard.
Klaus HeegerDanny HermelinMichael L. PinedoDvir ShabtayPublished in: CoRR (2024)
Keyphrases
- number of tardy jobs
- single machine
- scheduling problem
- np hard
- processing times
- single machine scheduling problem
- weighted number of tardy jobs
- flowshop
- total weighted tardiness
- earliness tardiness
- minimize total
- maximum lateness
- release times
- sequence dependent setup times
- release dates
- setup times
- approximation algorithms
- scheduling jobs
- special case
- branch and bound algorithm
- np complete
- lower bound
- tabu search
- linear programming
- integer programming
- parallel machines
- optimal solution
- constraint satisfaction problems
- worst case
- dynamic programming
- computational complexity
- knapsack problem
- precedence constraints
- job shop scheduling problem
- upper bound
- completion times
- lagrangian relaxation
- identical machines
- resource allocation