A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem

Abstract

W present a new exact algorithm for the assembly line balancing problem. The algorithm finds and verifies the optimal solution for every problem in the combined benchmarks of Hoffmann, Talbot, and Scholl in less than one-half second per problem, on average, including one problem that has remained open for over 10 years. The previous best-known algorithm is… (More)
DOI: 10.1287/ijoc.1110.0462

Topics

2 Figures and Tables

Cite this paper

@article{Sewell2012ABB, title={A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem}, author={Edward C. Sewell and Sheldon H. Jacobson}, journal={INFORMS Journal on Computing}, year={2012}, volume={24}, pages={433-442} }