A branch-and-bound algorithm to minimize the line length of a two-sided assembly line.
Xiaofeng HuErfei WuJinsong BaoJin YePublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- branch and bound algorithm
- assembly line
- precedence constraints
- production line
- assembly line balancing
- branch and bound
- lower bound
- beam search
- optimal solution
- upper bound
- np hard
- search tree
- lower bounding
- single machine scheduling problem
- randomly generated problems
- combinatorial optimization
- upper bounding
- production system
- search algorithm
- finding an optimal solution
- processing times
- manufacturing systems
- scheduling problem
- special case
- search strategies
- genetic programming
- simulated annealing
- expert systems
- computational complexity