메뉴 건너뛰기




Volumn 236, Issue 2, 2014, Pages 403-409

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

Author keywords

Assembly line balancing; Branch and bound; Combinatorial optimization

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING;

EID: 84896488270     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.11.033     Document Type: Article
Times cited : (76)

References (16)
  • 1
    • 84874540167 scopus 로고    scopus 로고
    • A taxonomy of line balancing problems and their solution approaches
    • O. Battaïa, and A. Dolgui A taxonomy of line balancing problems and their solution approaches International Journal of Production Economics 142 2 2013 259 277
    • (2013) International Journal of Production Economics , vol.142 , Issue.2 , pp. 259-277
    • Battaïa, O.1    Dolgui, A.2
  • 2
    • 55149094562 scopus 로고    scopus 로고
    • A dynamic programming based heuristic for the assembly line balancing problem
    • J. Bautista, and J. Pereira A dynamic programming based heuristic for the assembly line balancing problem European Journal of Operational Research 194 3 2009 787 794
    • (2009) European Journal of Operational Research , vol.194 , Issue.3 , pp. 787-794
    • Bautista, J.1    Pereira, J.2
  • 3
    • 0022768294 scopus 로고
    • A survey of exact algorithms for the simple assembly line balancing problem
    • I. Baybars A survey of exact algorithms for the simple assembly line balancing problem Management Science 32 8 1986 909 932
    • (1986) Management Science , vol.32 , Issue.8 , pp. 909-932
    • Baybars, I.1
  • 4
    • 0037448813 scopus 로고    scopus 로고
    • An enumerative heuristic and reduction methods for the assembly line balancing problem
    • K. Fleszar, and K. Hindi An enumerative heuristic and reduction methods for the assembly line balancing problem European Journal of Operational Research 145 3 2003 606 620
    • (2003) European Journal of Operational Research , vol.145 , Issue.3 , pp. 606-620
    • Fleszar, K.1    Hindi, K.2
  • 5
    • 0000030393 scopus 로고
    • Assembly line balancing with a precedence matrix
    • T. Hoffmann Assembly line balancing with a precedence matrix Management Science 9 4 1963 551 562
    • (1963) Management Science , vol.9 , Issue.4 , pp. 551-562
    • Hoffmann, T.1
  • 6
    • 0026487247 scopus 로고
    • EUREKA: A hybrid system for assembly line balancing
    • T. Hoffmann EUREKA: A hybrid system for assembly line balancing Management Science 38 1 1992 39 47
    • (1992) Management Science , vol.38 , Issue.1 , pp. 39-47
    • Hoffmann, T.1
  • 7
    • 0023963644 scopus 로고
    • Optimally balancing large assembly lines with "fABLE"
    • R. Johnson Optimally balancing large assembly lines with "FABLE" Management Science 34 2 1988 240 253
    • (1988) Management Science , vol.34 , Issue.2 , pp. 240-253
    • Johnson, R.1
  • 8
    • 0000436404 scopus 로고
    • Finding optimal line balances with OptPack
    • F. Nourie, and E. Venta Finding optimal line balances with OptPack Operations Research Letters 10 3 1991 165 171
    • (1991) Operations Research Letters , vol.10 , Issue.3 , pp. 165-171
    • Nourie, F.1    Venta, E.2
  • 9
    • 84875229599 scopus 로고    scopus 로고
    • Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
    • A. Otto, C. Otto, and A. Scholl Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing European Journal of Operational Research 228 1 2013 33 45
    • (2013) European Journal of Operational Research , vol.228 , Issue.1 , pp. 33-45
    • Otto, A.1    Otto, C.2    Scholl, A.3
  • 10
    • 25144486368 scopus 로고    scopus 로고
    • An linear programming based lower bound for the simple assembly line balancing problem
    • M. Peeters, and Z. Degraeve An linear programming based lower bound for the simple assembly line balancing problem European Journal of Operational Research 168 3 2006 716 731
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 716-731
    • Peeters, M.1    Degraeve, Z.2
  • 11
    • 0035342742 scopus 로고    scopus 로고
    • Designing a mixed-model, open-station assembly line using mixed-integer programming
    • B. Sarker, and H. Pan Designing a mixed-model, open-station assembly line using mixed-integer programming The Journal of the Operational Research Society 52 5 2001 545 558
    • (2001) The Journal of the Operational Research Society , vol.52 , Issue.5 , pp. 545-558
    • Sarker, B.1    Pan, H.2
  • 12
    • 25144482035 scopus 로고    scopus 로고
    • State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
    • A. Scholl, and C. Becker State-of-the-art exact and heuristic solution procedures for simple assembly line balancing European Journal of Operational Research 168 3 2006 666 693
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 666-693
    • Scholl, A.1    Becker, C.2
  • 13
    • 0001193704 scopus 로고    scopus 로고
    • SALOME: A bidirectional branch-and-bound procedure for assembly line balancing
    • A. Scholl, and R. Klein SALOME: A bidirectional branch-and-bound procedure for assembly line balancing INFORMS Journal on Computing 9 4 1997 319 334
    • (1997) INFORMS Journal on Computing , vol.9 , Issue.4 , pp. 319-334
    • Scholl, A.1    Klein, R.2
  • 14
    • 0033115142 scopus 로고    scopus 로고
    • Balancing assembly lines effectively a computational comparison
    • A. Scholl, and R. Klein Balancing assembly lines effectively a computational comparison European Journal of Operational Research 114 1 1999 50 58
    • (1999) European Journal of Operational Research , vol.114 , Issue.1 , pp. 50-58
    • Scholl, A.1    Klein, R.2
  • 15
    • 84867541884 scopus 로고    scopus 로고
    • A branch bound and remember algorithm for the simple assembly line balancing problem
    • E. Sewell, and S. Jacobson A branch bound and remember algorithm for the simple assembly line balancing problem INFORMS Journal on Computing 24 3 2012 433 442
    • (2012) INFORMS Journal on Computing , vol.24 , Issue.3 , pp. 433-442
    • Sewell, E.1    Jacobson, S.2
  • 16
    • 84869493632 scopus 로고    scopus 로고
    • A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
    • E. Sewell, J. Sauppe, D. Morrison, S. Jacobson, and G. Kao A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times Journal of Global Optimization 54 4 2012 791 812
    • (2012) Journal of Global Optimization , vol.54 , Issue.4 , pp. 791-812
    • Sewell, E.1    Sauppe, J.2    Morrison, D.3    Jacobson, S.4    Kao, G.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.