Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints.
Zhixin LiuPublished in: Comput. Oper. Res. (2010)
Keyphrases
- release dates
- single machine scheduling problem
- maximum lateness
- precedence constraints
- scheduling problem
- sequence dependent setup times
- branch and bound algorithm
- single machine
- setup times
- parallel machines
- approximation algorithms
- partially ordered
- partial order
- global constraints
- processing times
- np hard
- flowshop
- computational complexity
- branch and bound
- optimal solution
- resource consumption
- integer programming
- combinatorial optimization
- lower bound