A branch-and-bound algorithm for assembly line worker assignment and balancing problems.
Mariona VilàJordi PereiraPublished in: Comput. Oper. Res. (2014)
Keyphrases
- assembly line
- branch and bound algorithm
- precedence constraints
- randomly generated problems
- branch and bound
- lower bound
- beam search
- scheduling problem
- combinatorial optimization
- manufacturing systems
- upper bound
- mixed integer linear programming
- optimal solution
- finding an optimal solution
- branch and bound method
- np hard
- search tree
- single machine scheduling problem
- upper bounding
- integer programming
- approximation algorithms
- optimization model
- simulated annealing
- search space
- weighted max sat
- neural network