Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates.
Sven JägerPublished in: Oper. Res. Lett. (2018)
Keyphrases
- release dates
- identical parallel machines
- precedence constraints
- scheduling problem
- branch and bound algorithm
- scheduling jobs
- single machine scheduling problem
- sequence dependent setup times
- parallel machines
- maximum lateness
- single machine
- approximation algorithms
- partially ordered
- partial order
- release times
- setup times
- global constraints
- lower bound
- processing times
- combinatorial optimization
- steady state