A Branch-and-Bound Algorithm for the Talent Scheduling Problem.
Xiaocong LiangZizhen ZhangHu QinSongshan GuoAndrew LimPublished in: IEA/AIE (1) (2014)
Keyphrases
- branch and bound algorithm
- scheduling problem
- np hard
- precedence constraints
- lower bound
- dominance rules
- branch and bound
- single machine scheduling problem
- single machine
- optimal solution
- setup times
- upper bound
- strongly np hard
- flowshop
- lower bounding
- upper bounding
- approximation algorithms
- release dates
- sequence dependent setup times
- special case
- randomly generated problems
- tabu search
- integer programming
- maximum lateness
- processing times
- combinatorial optimization
- lagrangian relaxation
- mixed integer linear programming
- linear programming
- variable ordering
- branch and bound method
- computational complexity
- max sat
- parallel machines
- neural network
- evolutionary algorithm
- maximum clique
- genetic algorithm