A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan.
Lingfa LuLiqi ZhangPublished in: RAIRO Oper. Res. (2019)
Keyphrases
- release dates
- precedence constraints
- approximation algorithms
- single machine scheduling problem
- processing times
- maximum lateness
- deteriorating jobs
- single machine
- scheduling problem
- release times
- sequence dependent setup times
- completion times
- branch and bound algorithm
- np hard
- parallel machine scheduling problem
- identical parallel machines
- scheduling jobs
- special case
- job processing times
- worst case
- polynomial time approximation
- lower bound
- flowshop
- parallel machines
- combinatorial optimization
- global constraints
- lagrangian relaxation
- partially ordered
- knapsack problem
- partial order
- branch and bound
- upper bound
- evolutionary algorithm