Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines.
Rubing ChenJinjiang YuanPublished in: Discret. Appl. Math. (2021)
Keyphrases
- np hardness
- release times
- single machine
- release dates
- np hard
- scheduling problem
- single machine scheduling problem
- approximation algorithms
- processing times
- number of late jobs
- precedence constraints
- branch and bound algorithm
- learning effect
- sequence dependent setup times
- scheduling jobs
- response time
- mixed integer
- lower bound
- lagrangian relaxation
- parallel machines
- completion times
- special case
- setup times
- bayesian networks
- linear programming
- worst case
- dynamic programming
- optimal solution