Login / Signup
An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations.
Talip Kellegöz
Bilal Toklu
Published in:
Comput. Oper. Res. (2012)
Keyphrases
</>
branch and bound algorithm
test problems
randomly generated problems
assembly line balancing
lower bound
np hard
branch and bound
optimal solution
upper bound
finding an optimal solution
optimization problems
np complete
decision problems
precedence constraints
assembly line