Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.
Vincent T'kindtFederico Della CroceCarl EssweinPublished in: J. Sched. (2004)
Keyphrases
- search strategies
- branch and bound
- scheduling problem
- flowshop
- search algorithm
- lower bound
- branch and bound algorithm
- upper bound
- column generation
- processing times
- np hard
- optimal solution
- search space
- combinatorial optimization
- branch and bound procedure
- single machine
- branch and bound method
- tree search
- randomly generated problems
- tabu search
- beam search
- tree search algorithm
- search strategy
- heuristic search
- co occurrence
- special case
- search problems
- max sat
- branch and bound search
- depth first search
- distributed constraint optimization
- evolutionary algorithm