Unary NP-hardness of minimizing total weighted tardiness with generalized due dates.
Yuan GaoJinjiang YuanPublished in: Oper. Res. Lett. (2016)
Keyphrases
- np hardness
- total weighted tardiness
- processing times
- np hard
- scheduling problem
- single machine
- lagrangian relaxation
- approximation algorithms
- single machine scheduling problem
- sequence dependent setup times
- release dates
- setup times
- job shop scheduling problem
- flowshop
- job shop
- parallel machines
- mixed integer
- integer programming
- lower bound
- special case
- branch and bound algorithm
- optimal solution
- linear program
- linear programming
- upper bound
- variable neighborhood search
- bayesian networks
- vehicle routing problem
- parallel algorithm