Fast, Effective Algorithms for Simple Assembly Line Balancing Problems

Steven T. Hackman, Michael J. Magazine and T. S. Wee
Additional contact information
Steven T. Hackman: Georgia Institute of Technology, Atlanta, Georgia
Michael J. Magazine: University of Waterloo, Waterloo, Ontario, Canada
T. S. Wee: Canadian Pacific Railroad, Montreal, Quebec, Canada

Operations Research, 1989, vol. 37, issue 6, 916-924

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 (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.6.916 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:6:p:916-924

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().