Research Reports from the Department of Operations
Document Type
Report
Publication Date
5-1-1982
Abstract
The objective of this research is to develop a portable computer program to compute an optimal solution for single model deterministic assembly line balancing problems via a branch and bound algorithm. The branch and bound procedure will employ the good heuristic solutions for "pruning" the resulting decision trees. Such pruning should make normally inefficient branch and bound methods both practical and efficient for a high proportion of assembly line balancing problems.
Keywords
Operations research, Branch and bound algorithms, Computer programming, Assembly-line methods, Production engineering, Mathematical optimization, Heuristic algorithms
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 507
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Karande, Sanjeev, "A Computerized Branch and Bound Algorithm for Solving the Assembly Line Balancing Problem" (1982). Research Reports from the Department of Operations. 94.
https://commons.case.edu/wsom-ops-reports/94