Abstract
Two-sided (left- and right-side) assembly lines are often used in assembly of large-sized products, such as buses and trucks. A large number of exact algorithms and heuristics have been proposed to balance the well-known classical one-sided assembly lines. However, little attention has been paid to balancing the two-sided lines. Moreover, according to our best knowledge, there is no published work in balancing the two-sided assembly line exactly. In this study, a branch-and-bound algorithm is proposed to solve the balancing problem optimally. Experiments are carried out to demonstrate the performance of the proposed method and the results are promising.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bartholdi JJ (1993) Balancing two-sided assembly lines: a case study. Int J Prod Res 31(10):2447–2461
Kim YK, Kim Y, Kim YJ (2000) Two-sided assembly line balancing: a genetic algorithm approach. Prod Plan Control 11(1):44–53
Johnson RV (1988) Optimally balancing large assembly line with “FABLE”. Manage Sci 34(2):240–253
Johnson RV (1983) A branch-and-bound algorithm for assembly line balancing problems with formulation irregularities. Manage Sci 29(11):1309–1323
Saltzman MJ, Baybars I (1987) A two-process implicit enumeration algorithm for the simple assembly line balancing problem. Eur J Oper Res 32(1):118–129
Scholl A, Klein R (1997) SALOME: A bidirectional branch-and-bound procedure for assembly line. INFORMS J Comput 9(4):319–334
Hoffmann TR (1992) EUREKA: A hybrid system for assembly line balancing. Manage Sci 38(1):39–47
Fleszar K, Hindi KS (2003) An enumerative heuristic and reduction methods for the assembly line balancing problem. Eur J Oper Res 145(3):606–620
Helgeson WB, Birnie DP (1961) Assembly line balancing using the ranked positional weight technique. J Ind Eng 12(6):394–398
Schrage L, Baker KR (1978) Dynamic programming solution of sequencing problems with precedence constraints. Oper Res 26(3):444–449
Lee TO, Kim Y, Kim YK (2001) Two-sided assembly line balancing to maximize work relatedness and slackness. Comput Ind Eng 40(3):273–292
Baykasoglu A, Dereli T (2006) Two-sided assembly line balancing using an ant-colony-based heuristic. Int J Adv Manuf Technol DOI 10.1007/s00170-006-0861-3
Hu XF, Wu EF, Jin Y (2007) A station-oriented enumerative algorithm for two-sided assembly line balancing. Eur J Oper Res DOI 10.1016/j.ejor.2007.01.022
Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168(3):666–693
Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3), 694–715
Ghosh S, Gagnon RJ (1989) A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. Int J Prod Res 27(4):637–670
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, EF., Jin, Y., Bao, JS. et al. A branch-and-bound algorithm for two-sided assembly line balancing. Int J Adv Manuf Technol 39, 1009–1015 (2008). https://doi.org/10.1007/s00170-007-1286-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-007-1286-3