Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
Steven T. Hackman, Michael J. Magazine, T. S. Wee
Operations Research · 1989 · Volume 37 · Issue 6
Abstract
A simple, fast and effective heuristic for the Simple Assembly Line Balancing Type I problem (minimizing the number of workstations) is proposed. A fast and effective branch-and-bound algorithm, which incorporates this heuristic for use in bounding, is developed. The algorithm introduces heuristic fathoming as a technique for reducing the size of the branch-and-bound tree. Methods to solve the Simple Assembly Line Balancing Type II problem (maximizing the production rate) are also described. Upper bounds on all heuristics for both problems are provided.
Keywords
inventory/production, approximations/heuristics: analysis of algorithms, heuristics and branch-and-bound, production/scheduling, flexible manufacturing/line balancing: simple assembly lines
Enable JavaScript for citation tools and additional paper interactions.