A branch and bound algorithm for the cyclic job-shop problem with transportation.
Peter BruckerEdmund K. BurkeSven GroenemeyerPublished in: Comput. Oper. Res. (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- test problems
- upper bound
- np hard
- optimal solution
- lower bounding
- mixed integer linear programming
- search tree
- combinatorial optimization
- precedence constraints
- job shop scheduling problem
- upper bounding
- randomly generated problems
- lagrangian relaxation
- finding an optimal solution
- maximum clique
- branch and bound method
- max sat
- single machine scheduling problem
- transportation networks
- search algorithm
- variable ordering
- lower and upper bounds
- column generation
- linear program
- optimization problems