Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling.
Matthew J. StreeterStephen F. SmithPublished in: ICAPS (2006)
Keyphrases
- branch and bound algorithm
- job shop scheduling
- job shop scheduling problem
- combinatorial optimization
- combinatorial optimization problems
- optimal solution
- branch and bound
- lower bound
- scheduling problem
- np hard
- simulated annealing
- memetic algorithm
- test problems
- lower bounding
- upper bound
- benchmark problems
- tabu search
- precedence constraints
- metaheuristic
- traveling salesman problem
- randomly generated problems
- search algorithm
- mixed integer linear programming
- single machine scheduling problem
- upper bounding
- optimization problems
- graph model
- search space
- genetic algorithm
- mathematical programming
- max sat
- global optimization
- probabilistic model