An enhanced branch-and-bound algorithm for the talent scheduling problem.
Hu QinZizhen ZhangAndrew LimXiaocong LiangPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- branch and bound algorithm
- scheduling problem
- np hard
- precedence constraints
- lower bound
- dominance rules
- branch and bound
- single machine scheduling problem
- setup times
- optimal solution
- single machine
- sequence dependent setup times
- maximum lateness
- upper bound
- strongly np hard
- lower bounding
- combinatorial optimization
- flowshop
- randomly generated problems
- lagrangian relaxation
- upper bounding
- human resources
- tabu search
- linear programming
- release dates
- mixed integer linear programming
- branch and bound method
- special case
- integer programming
- objective function
- column generation
- variable ordering
- maximum clique
- computational complexity
- max sat
- processing times
- linear program
- finding an optimal solution