메뉴 건너뛰기




Volumn 199, Issue 2, 2009, Pages 359-374

Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure

Author keywords

Assembly line balancing; Combinatorial optimization; Mass production; Sequencing

Indexed keywords

ASSEMBLY LINE BALANCING; ASSEMBLY LINE BALANCING PROBLEMS; ASSEMBLY LINES; BRANCH AND BOUNDS; COMPUTATIONAL EXPERIMENTS; CYCLE TIME; EFFECTIVE SOLUTIONS; INTEGER LINEAR PROGRAMS; MASS-PRODUCTION; PROBLEM DEFINITIONS; REAL-WORLD; SEQUENCING; SOLUTION APPROACHES; WORK STATIONS;

EID: 67349130287     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.11.051     Document Type: Article
Times cited : (101)

References (47)
  • 2
    • 0020816054 scopus 로고
    • A method for assembly line balancing with more than one worker in each station
    • Akagi F., Osaki H., and Kikuchi S. A method for assembly line balancing with more than one worker in each station. International Journal of Production Research 21 (1983) 755-770
    • (1983) International Journal of Production Research , vol.21 , pp. 755-770
    • Akagi, F.1    Osaki, H.2    Kikuchi, S.3
  • 3
    • 40849130689 scopus 로고
    • COMSOAL: A computer method of sequencing operations for assembly lines
    • Arcus A.L. COMSOAL: A computer method of sequencing operations for assembly lines. International Journal of Production Research 4 (1966) 259-277
    • (1966) International Journal of Production Research , vol.4 , pp. 259-277
    • Arcus, A.L.1
  • 4
    • 0024673749 scopus 로고
    • Assembly line balancing with parallel workstations and dead time
    • Bard J.F. Assembly line balancing with parallel workstations and dead time. International Journal of Production Research 27 (1989) 1005-1018
    • (1989) International Journal of Production Research , vol.27 , pp. 1005-1018
    • Bard, J.F.1
  • 6
    • 0022768294 scopus 로고
    • A survey of exact algorithms for the simple assembly line balancing problem
    • Baybars I. 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
  • 9
    • 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
  • 12
    • 0016027179 scopus 로고
    • Assembly line balancing with multiple stations
    • Buxey G. Assembly line balancing with multiple stations. Management Science 20 (1974) 1010-1021
    • (1974) Management Science , vol.20 , pp. 1010-1021
    • Buxey, G.1
  • 15
    • 0012575285 scopus 로고    scopus 로고
    • New classes of fast lower bounds for bin packing problems
    • Fekete S.P., and Schepers J. New classes of fast lower bounds for bin packing problems. Mathematical Programming 91 (2001) 11-31
    • (2001) Mathematical Programming , vol.91 , pp. 11-31
    • Fekete, S.P.1    Schepers, J.2
  • 16
    • 0037448813 scopus 로고    scopus 로고
    • An enumerative heuristic and reduction methods for the assembly line balancing problem
    • Fleszar K., and Hindi K.S. 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
  • 17
    • 67349189800 scopus 로고
    • Leistungsabstimmung von Montagelinien unter Berücksichtigung praktischer Restriktionen
    • Freie Universität Berlin
    • Gehring, H., Boguschewski, A. (1990). Leistungsabstimmung von Montagelinien unter Berücksichtigung praktischer Restriktionen. Working Paper 3/1990, Faculty for Economics, Freie Universität Berlin.
    • (1990) Working Paper 3/1990, Faculty for Economics
    • Gehring, H.1    Boguschewski, A.2
  • 18
    • 67349232290 scopus 로고    scopus 로고
    • Interaktive Montagelinienaustaktung in der Automobilindustrie
    • Hildebrand S. Interaktive Montagelinienaustaktung in der Automobilindustrie. OR News (2006) 38-39
    • (2006) OR News , pp. 38-39
    • Hildebrand, S.1
  • 20
    • 0000804223 scopus 로고
    • A computing procedure for a line balancing problem
    • Jackson J.R. A computing procedure for a line balancing problem. Management Science (1956) 261-271
    • (1956) Management Science , pp. 261-271
    • Jackson, J.R.1
  • 21
    • 0020848902 scopus 로고
    • A branch and bound algorithm for assembly line balancing problems with formulation irregularities
    • Johnson R.V. A branch and bound algorithm for assembly line balancing problems with formulation irregularities. Management Science 29 (1983) 1309-1324
    • (1983) Management Science , vol.29 , pp. 1309-1324
    • Johnson, R.V.1
  • 22
    • 0023963644 scopus 로고
    • Optimally balancing large assembly lines with "FABLE
    • Johnson R.V. 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
  • 23
    • 0002866635 scopus 로고
    • The critical-path method: Resources planning and scheduling
    • Muth J.F., and Thompson G.L. (Eds), Prentice-Hall, Englewood Cliffs
    • Kelley J.E. The critical-path method: Resources planning and scheduling. In: Muth J.F., and Thompson G.L. (Eds). Industrial Scheduling (1963), Prentice-Hall, Englewood Cliffs 347-365
    • (1963) Industrial Scheduling , pp. 347-365
    • Kelley, J.E.1
  • 24
    • 3342985995 scopus 로고
    • A review of analytical systems of line balancing
    • Kilbridge M.D., and Wester L. A review of analytical systems of line balancing. Operations Research 10 (1962) 626-638
    • (1962) Operations Research , vol.10 , pp. 626-638
    • Kilbridge, M.D.1    Wester, L.2
  • 25
    • 0033993174 scopus 로고    scopus 로고
    • Two-sided assembly line balancing: A genetic algorithm approach
    • Kim Y.K., Kim Y., and Kim Y.J. Two-sided assembly line balancing: A genetic algorithm approach. Production Planning & Control 11 (2000) 44-53
    • (2000) Production Planning & Control , vol.11 , pp. 44-53
    • Kim, Y.K.1    Kim, Y.2    Kim, Y.J.3
  • 27
    • 67349283920 scopus 로고    scopus 로고
    • Constraint programming
    • Stadtler H., and Kilger C. (Eds), Springer, Berlin
    • Klein R. Constraint programming. In: Stadtler H., and Kilger C. (Eds). Supply Chain Management and Advanced Planning. second ed. (2002), Springer, Berlin 411-418
    • (2002) Supply Chain Management and Advanced Planning. second ed. , pp. 411-418
    • Klein, R.1
  • 31
    • 0001253255 scopus 로고
    • Optimal sequencing of a single machine subject to precedence constraints
    • Lawler E.L. Optimal sequencing of a single machine subject to precedence constraints. Management Science 19 (1973) 544-546
    • (1973) Management Science , vol.19 , pp. 544-546
    • Lawler, E.L.1
  • 32
    • 0035399914 scopus 로고    scopus 로고
    • Two-sided assembly line balancing to maximize work relatedness and slackness
    • Lee T.O., Kim Y., and Kim Y.K. Two-sided assembly line balancing to maximize work relatedness and slackness. Computers and Industrial Engineering 40 (2001) 273-292
    • (2001) Computers and Industrial Engineering , vol.40 , pp. 273-292
    • Lee, T.O.1    Kim, Y.2    Kim, Y.K.3
  • 34
  • 35
    • 0000480311 scopus 로고
    • An algorithm for a general class of precedence and resource constrained project scheduling problems
    • Slowinski R., and Weglarz J. (Eds), Elsevier, Amsterdam
    • Patterson J.H., Slowinski R., Talbot F.B., and Weglarz J. An algorithm for a general class of precedence and resource constrained project scheduling problems. In: Slowinski R., and Weglarz J. (Eds). Advances in Project Scheduling (1989), Elsevier, Amsterdam 3-29
    • (1989) Advances in Project Scheduling , pp. 3-29
    • Patterson, J.H.1    Slowinski, R.2    Talbot, F.B.3    Weglarz, J.4
  • 37
    • 0000396642 scopus 로고
    • Branch and bound and heuristic procedure for assembly line balancing with paralleling of stations
    • Pinto P.A., Dannenbring D.G., and Khumawala B.M. Branch and bound and heuristic procedure for assembly line balancing with paralleling of stations. International Journal of Production Research 19 (1981) 565-576
    • (1981) International Journal of Production Research , vol.19 , pp. 565-576
    • Pinto, P.A.1    Dannenbring, D.G.2    Khumawala, B.M.3
  • 38
    • 0012064450 scopus 로고
    • Assembly line design with incompatible task assignments
    • Rachamadugu R. Assembly line design with incompatible task assignments. Journal of Operations Management 10 (1991) 469-487
    • (1991) Journal of Operations Management , vol.10 , pp. 469-487
    • Rachamadugu, R.1
  • 41
    • 25144482035 scopus 로고    scopus 로고
    • State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
    • Scholl A., and Becker C. State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research 168 (2006) 666-693
    • (2006) European Journal of Operational Research , vol.168 , pp. 666-693
    • Scholl, A.1    Becker, C.2
  • 42
    • 67349090941 scopus 로고    scopus 로고
    • Scholl, A., Fliedner, M., Boysen, N., 2008. ABSALOM: Balancing assembly lines with assignment restrictions. Jena Research Papers in Business and Economics (JBE) 2/2008, FSU Jena.
    • Scholl, A., Fliedner, M., Boysen, N., 2008. ABSALOM: Balancing assembly lines with assignment restrictions. Jena Research Papers in Business and Economics (JBE) 2/2008, FSU Jena.
  • 43
    • 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
  • 44
    • 0033115142 scopus 로고    scopus 로고
    • Balancing assembly lines effectively - a computational comparison
    • Scholl A., and Klein R. 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
  • 45
    • 0031185499 scopus 로고    scopus 로고
    • BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
    • Scholl A., Klein R., and Jürgens C. 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
  • 46
    • 0041556713 scopus 로고
    • Summary of a heuristic line balancing procedure
    • Tonge F.M. Summary of a heuristic line balancing procedure. Management Science 7 (1960) 21-39
    • (1960) Management Science , vol.7 , pp. 21-39
    • Tonge, F.M.1
  • 47
    • 0020116655 scopus 로고
    • Assembly line balancing as generalized bin packing
    • Wee T., and Magazine M. Assembly line balancing as generalized bin packing. Operations Research Letters 1 (1982) 56-58
    • (1982) Operations Research Letters , vol.1 , pp. 56-58
    • Wee, T.1    Magazine, M.2


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