An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
We present a suite of computational results for the simple assembly line balancing problem. Our algorithm uses a branch, bound, and remember approach with cyclic best-first search. We successfully solve 1172 out of 1359 unsolved problems from a new problem database. We improve the best-known solution for an additional 184 problems.
assembly line balancing branch and bound combinatorial optimization