메뉴 건너뛰기




Volumn 97, Issue 3, 2005, Pages 343-352

A note on "an exact method for cost-oriented assembly line balancing"

Author keywords

Assembly line balancing; Branch and bound; Dominance rules; Mass production; Production cost

Indexed keywords

COSTS; INTEGER PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS); WAGES;

EID: 20344397182     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2004.09.009     Document Type: Article
Times cited : (24)

References (22)
  • 1
    • 0033881924 scopus 로고    scopus 로고
    • An exact method for cost-oriented assembly line balancing
    • M. Amen An exact method for cost-oriented assembly line balancing International Journal of Production Economics 64 2000 187 195
    • (2000) International Journal of Production Economics , vol.64 , pp. 187-195
    • Amen, M.1
  • 2
    • 0034294050 scopus 로고    scopus 로고
    • Heuristic methods for cost-oriented assembly line balancing: A survey
    • M. Amen Heuristic methods for cost-oriented assembly line balancing A survey International Journal of Production Economics 68 2000 1 14
    • (2000) International Journal of Production Economics , vol.68 , pp. 1-14
    • Amen, M.1
  • 3
    • 0035852818 scopus 로고    scopus 로고
    • Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time
    • M. Amen Heuristic methods for cost-oriented assembly line balancing A comparison on solution quality and computing time International Journal of Production Economics 69 2001 255 264
    • (2001) International Journal of Production Economics , vol.69 , pp. 255-264
    • Amen, M.1
  • 5
    • 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 1986 909 932
    • (1986) Management Science , vol.32 , pp. 909-932
    • Baybars, I.1
  • 6
    • 20344408213 scopus 로고    scopus 로고
    • A survey on problems and methods in generalized assembly line balancing
    • to appear
    • Becker, C., Scholl, A., 2003. A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, to appear.
    • (2003) European Journal of Operational Research
    • Becker, C.1    Scholl, A.2
  • 7
    • 0037448813 scopus 로고    scopus 로고
    • An enumerative heuristic and reduction methods for the assembly line balancing problem
    • K. Fleszar, and K.S. Hindi An enumerative heuristic and reduction methods for the assembly line balancing problem European Journal of Operational Research 145 2003 606 620
    • (2003) European Journal of Operational Research , vol.145 , pp. 606-620
    • Fleszar, K.1    Hindi, K.S.2
  • 8
    • 0026487247 scopus 로고
    • EUREKA: A hybrid system for assembly line balancing
    • T.R. Hoffmann EUREKA A hybrid system for assembly line balancing Management Science 38 1992 39 47
    • (1992) Management Science , vol.38 , pp. 39-47
    • Hoffmann, T.R.1
  • 9
    • 0000804223 scopus 로고
    • A computing procedure for a line balancing problem
    • J.R. Jackson A computing procedure for a line balancing problem Management Science 2 1956 261 271
    • (1956) Management Science , vol.2 , pp. 261-271
    • Jackson, J.R.1
  • 10
    • 0023963644 scopus 로고
    • Optimally balancing large assembly lines with "fABLE"
    • R.V. Johnson Optimally balancing large assembly lines with "FABLE" Management Science 34 1988 240 253
    • (1988) Management Science , vol.34 , pp. 240-253
    • Johnson, R.V.1
  • 11
    • 38249020984 scopus 로고
    • Lower bounds and reduction procedures for the bin packing problem
    • S. Martello, and P. Toth Lower bounds and reduction procedures for the bin packing problem Discrete Applied Mathematics 28 1990 59 70
    • (1990) Discrete Applied Mathematics , vol.28 , pp. 59-70
    • Martello, S.1    Toth, P.2
  • 13
    • 0016428867 scopus 로고
    • Assembly-line balancing: Zero-one programming with fibonacci search
    • J.H. Patterson, and J.J. Albracht Assembly-line balancing Zero-one programming with fibonacci search Operations Research 23 1975 166 172
    • (1975) Operations Research , vol.23 , pp. 166-172
    • Patterson, J.H.1    Albracht, J.J.2
  • 14
    • 0006102920 scopus 로고
    • A comparison of heuristic algorithms for cost-oriented assembly line balancing
    • O. Rosenberg, and H. Ziegler A comparison of heuristic algorithms for cost-oriented assembly line balancing Zeitschrift für Operations Research 36 1992 477 495
    • (1992) Zeitschrift für Operations Research , vol.36 , pp. 477-495
    • Rosenberg, O.1    Ziegler, H.2
  • 16
    • 28944441230 scopus 로고    scopus 로고
    • State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
    • to appear
    • Scholl, A., Becker, C., 2003. State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research, to appear.
    • (2003) European Journal of Operational Research
    • Scholl, A.1    Becker, C.2
  • 17
    • 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 1997 319 334
    • (1997) INFORMS Journal on Computing , vol.9 , pp. 319-334
    • Scholl, A.1    Klein, R.2
  • 18
    • 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 1999 50 58
    • (1999) European Journal of Operational Research , vol.114 , pp. 50-58
    • Scholl, A.1    Klein, R.2
  • 19
    • 0031185499 scopus 로고    scopus 로고
    • BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
    • A. Scholl, R. Klein, and C. Jürgens BISON A fast hybrid procedure for exactly solving the one-dimensional bin packing problem Computers & Operations Research 24 1997 627 645
    • (1997) Computers & Operations Research , vol.24 , pp. 627-645
    • Scholl, A.1    Klein, R.2    Jürgens, C.3
  • 20
    • 0017972181 scopus 로고
    • Dynamic programming solution of sequencing problems with precedence constraints
    • L. Schrage, and K.R. Baker Dynamic programming solution of sequencing problems with precedence constraints Operations Research 26 1978 444 449
    • (1978) Operations Research , vol.26 , pp. 444-449
    • Schrage, L.1    Baker, K.R.2
  • 21
    • 0032635871 scopus 로고    scopus 로고
    • A competitive branch-and-bound algorithm for the simple assembly line balancing problem
    • A. Sprecher A competitive branch-and-bound algorithm for the simple assembly line balancing problem International Journal of Production Research 37 1999 1787 1816
    • (1999) International Journal of Production Research , vol.37 , pp. 1787-1816
    • Sprecher, A.1


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