Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem.

•We propose new algorithms for minimizing the cycle time in robotic assembly lines.•The first is a branch-bound-and-remember method with cyclic best-first search.•The second is an iterative beam search.•Both methods use newly proposed lower bounds and dominance rules.•Our methods improve the results from the literature and are faster.