Abstract
In this paper, exact algorithms for solving the simple assembly line balancing type I problem are presented. The proposed algorithms consist of a constructive and two destructive algorithms. Several well-known lower-bound computational methods are also applied in these algorithms. Computational experiments were carried out to test the performance of the proposed algorithms based on a set of benchmark problem instances. The computational results show that the algorithms proposed in this paper are efficient in solving the simple assembly line balancing benchmark problem instances. Moreover, a problem instance whose optimal solution had previously been unknown is solved by one of the proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Talbot FB, Patterson JH, Gehrlein WV (1986) A comparative evaluation of heuristic line balancing techniques. Manage Sci 32(4):430–454
Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85–104
Scholl A, Christian B (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168(3):666–693
Johnson RV (1988) Optimally balancing large assembly lines with ‘FABLE’. Manage Sci 34(2):240–253
Hoffmann TR (1992) EUREKA: a hybrid system for assembly line balancing. Manage Sci 38(1):39–47
Hoffmann TR (1963) Assembly line balancing with a precedence matrix. Manage Sci 9(4):551–562
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
Liu SB, Ong HL, Huang HC (2003) Two bi-directional heuristics for the assembly line type II problem. Int J Adv Manuf Technol 22(9–10):656–661
Scholl A, Klein R (1997) SALOME: A bidirectional branch-and-bound procedure for assembly line balancing. INFORMS J Comput 9(4):319–334
Scholl A, Klein R (1999) Balancing assembly lines effectively - a computational comparison. Eur J Oper Res 114(1):50–58
Sprecher A (1999) A competitive branch-and-bound algorithm for the simple assembly line balancing problem. Int J Prod Res 37(8):1787–1816
Peeters M, Degraeve Z (2006) An linear programming based lower bound for the simple assembly line balancing problem. Eur J Oper Res 168(3):716–731
Berger I, Bourjolly JM, Laporte G (1992) Branch-and-bound algorithms for the multi-product assembly line balancing problem. Eur J Oper Res 58(2):215–222
Klein R, Scholl A (1999) Computing lower bounds by destructive improvement: an application to resource-constrained project scheduling. Eur J Oper Res 112(2):322–346
Scholl A (1993) Data of assembly line balancing problems, Research Report No. 16/93, Technische Hochschule Darmstadt, Germany
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, S.B., Ng, K.M. & Ong, H.L. Branch-and-bound algorithms for simple assembly line balancing problem. Int J Adv Manuf Technol 36, 169–177 (2008). https://doi.org/10.1007/s00170-006-0821-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-006-0821-y