메뉴 건너뛰기




Volumn 57, Issue 4, 2009, Pages 1155-1160

A new bidirectional heuristic for the assembly line balancing problem

Author keywords

Assembly line balancing problem; Bidirectional; Critical path method; Heuristic

Indexed keywords

0-1-INTEGER PROGRAMMING; ASSEMBLY LINE BALANCING PROBLEMS; BRANCH-AND-BOUND ALGORITHMS; CRITICAL PATH METHOD; DYNAMIC PROGRAMMING MODEL; EXACT SOLUTION; HEURISTIC APPROACH; LARGE-SCALE PROBLEM; LAYOUT PLANNING; MASS PRODUCTION; NP-HARD; NUMERICAL RESULTS; TASK ASSIGNMENT;

EID: 71849104220     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2009.05.004     Document Type: Article
Times cited : (33)

References (14)
  • 1
    • 25144450992 scopus 로고    scopus 로고
    • A survey on problems and methods in generalized assembly line balancing
    • Becker C., and Scholl A. A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research 168 (2006) 694-715
    • (2006) European Journal of Operational Research , vol.168 , pp. 694-715
    • Becker, C.1    Scholl, A.2
  • 4
    • 0013054874 scopus 로고
    • A dynamic programming approach to stochastic assembly line balancing
    • Carraway R.L. A dynamic programming approach to stochastic assembly line balancing. Management Science 35 (1989) 459-471
    • (1989) Management Science , vol.35 , pp. 459-471
    • Carraway, R.L.1
  • 5
    • 0024641634 scopus 로고
    • A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems
    • Ghosh S., and Gagnon R.J. A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. International Journal of Production Research 27 (1989) 637-670
    • (1989) International Journal of Production Research , vol.27 , pp. 637-670
    • Ghosh, S.1    Gagnon, R.J.2
  • 6
    • 0020751825 scopus 로고
    • An integer programming procedure for assembly system design problems
    • Graves S.C., and Lamar B.W. An integer programming procedure for assembly system design problems. Operations Research 31 (1983) 522-545
    • (1983) Operations Research , vol.31 , pp. 522-545
    • Graves, S.C.1    Lamar, B.W.2
  • 7
    • 0001474336 scopus 로고
    • An algorithm for the line balancing problem
    • Gutjahr A.L., and Nemhauser G.L. An algorithm for the line balancing problem. Management Science 11 (1964) 308-315
    • (1964) Management Science , vol.11 , pp. 308-315
    • Gutjahr, A.L.1    Nemhauser, G.L.2
  • 8
    • 0000804223 scopus 로고
    • A computing procedure for a line balancing problem
    • Jackson J.R. 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
  • 13
    • 0001193704 scopus 로고    scopus 로고
    • SALOME: A bidirectional branch and bound procedure for assembly line balancing
    • Scholl A., and Klein R. 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
  • 14
    • 0031543416 scopus 로고    scopus 로고
    • Simple assembly line balancing-heuristic approaches
    • Scholl A., and Voß S. Simple assembly line balancing-heuristic approaches. Journal of Heuristics 2 (1996) 217-244
    • (1996) Journal of Heuristics , vol.2 , pp. 217-244
    • Scholl, A.1    Voß, S.2


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