A heuristic and a branch-and-bound algorithm for the Assembly Line Worker Assignment and Balancing Problem.
Leonardo BorbaMarcus RittPublished in: Comput. Oper. Res. (2014)
Keyphrases
- assembly line
- branch and bound algorithm
- precedence constraints
- beam search
- branch and bound
- optimal solution
- finding an optimal solution
- lower bound
- lower bounding
- combinatorial optimization
- variable ordering
- lagrangian relaxation
- branch and bound method
- upper bound
- search algorithm
- search space
- np hard
- single machine scheduling problem
- search tree
- maximum lateness
- upper bounding
- production line
- search strategies
- strongly np hard
- max sat
- processing times
- metaheuristic
- heuristic search
- tabu search
- manufacturing systems
- neural network
- expert systems
- traveling salesman problem
- simulated annealing
- production system
- linear programming
- np complete
- linear programming relaxation