Branch-and-bound algorithms for simple assembly line balancing problem

International Journal of Advanced Manufacturing Technology

Volumn 36, Issue 1-2, 2008, Pages 169-177

  Liu, S B ^a   Ng, K M ^a   Ong, H L ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Assembly line balancing; Branch and bound; Destructive algorithm

Indexed keywords

ALGORITHMS; BALANCING; BENCHMARKING; BRANCH AND BOUND METHOD; COMPUTATIONAL METHODS; PROBLEM SOLVING;

ASSEMBLY LINE BALANCING; BENCHMARK PROBLEM; DESTRUCTIVE ALGORITHM; EXACT ALGORITHMS;

ASSEMBLY MACHINES;

EID: 38949137145     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0821-y     Document Type: Article

References (15)

1. Talbot FB, Patterson JH, Gehrlein WV (1986) A comparative evaluation of heuristic line balancing techniques. Manage Sci 32(4):430-454
2. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85-104
3. 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
4. Johnson RV (1988) Optimally balancing large assembly lines with 'FABLE'. Manage Sci 34(2):240-253
5. Hoffmann TR (1992) EUREKA: a hybrid system for assembly line balancing. Manage Sci 38(1):39-47
6. Hoffmann TR (1963) Assembly line balancing with a precedence matrix. Manage Sci 9(4):551-562
7. 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
8. 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
9. Scholl A, Klein R (1997) SALOME: A bidirectional branch-and-bound procedure for assembly line balancing. INFORMS J Comput 9(4):319-334
10. Scholl A, Klein R (1999) Balancing assembly lines effectively - a computational comparison. Eur J Oper Res 114(1):50-58
11. Sprecher A (1999) A competitive branch-and-bound algorithm for the simple assembly line balancing problem. Int J Prod Res 37(8):1787-1816
12. 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
13. 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
14. 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
15. Scholl A (1993) Data of assembly line balancing problems, Research Report No. 16/93, Technische Hochschule Darmstadt, Germany