Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound.
Christian ArtiguesMichel GendreauLouis-Martin RousseauAdrien VergnaudPublished in: Comput. Oper. Res. (2009)
Keyphrases
- branch and bound
- job shop scheduling problem
- combinatorial optimization
- memetic algorithm
- timetabling problem
- combinatorial optimization problems
- job shop scheduling
- branch and bound algorithm
- simulated annealing
- critical path
- integer programming problems
- column generation
- metaheuristic
- tabu search
- traveling salesman problem
- search algorithm
- branch and bound search
- tree search
- optimization problems
- search strategies
- benchmark problems
- genetic algorithm
- optimal solution
- lower bound
- scheduling problem
- network design problem
- evolutionary algorithm
- search space
- branch and bound procedure
- bnb adopt
- graph model
- constraint programming
- upper bound
- branch and bound method
- heuristic search
- max sat
- multi objective
- implicit enumeration