Article ID: | iaor20042008 |
Country: | United Kingdom |
Volume: | 41 |
Issue: | 17 |
Start Page Number: | 4185 |
End Page Number: | 4210 |
Publication Date: | Jan 2003 |
Journal: | International Journal of Production Research |
Authors: | Schniederjans M.J., Aase G.R., Olson J.R. |
Keywords: | programming: branch and bound |
The U-shaped assembly line-balancing problem can be solved using optimization procedures or algorithms, including branch-and-bound procedures. This paper considers design elements that should be included in these solution methods for solving the U-shaped assembly line-balancing problem, New solution procedures are proposed and compared experimentally with several existing procedures using a variety of problem sets from the literature. The results show that the substantial improvement in the efficacy of the new solution procedures over existing methods is due primarily to the newly developed ‘Paired Tasks’ lower bound. Results also show the relative importance of various design elements comprising a branch-and-bound procedure.