메뉴 건너뛰기




Volumn 200, Issue 3, 2010, Pages 688-701

Absalom: Balancing assembly lines with assignment restrictions

Author keywords

Assembly line balancing; Assignment restrictions; Branch and bound; Combinatorial optimization

Indexed keywords

ASSEMBLY LINE; ASSEMBLY LINE BALANCING; ASSEMBLY LINE BALANCING PROBLEMS; ASSIGNMENT RESTRICTIONS; BRANCH AND BOUNDS; BRANCH-AND-BOUND; COMPUTATIONAL EXPERIMENT; CONSTRAINT PROGRAMMING; EXACT SOLUTION; FAST SOLUTION METHOD; LOGICAL TESTS; MANUFACTURING PRODUCTS; REAL-WORLD; SIMPLE ASSEMBLY LINE BALANCING; SOLUTION PROCEDURE; WORK STATION;

EID: 69749094246     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.01.049     Document Type: Article
Times cited : (89)

References (69)
  • 2
    • 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. Int. J. Product. Res. 4 (1966) 259-277
    • (1966) Int. J. Product. Res. , vol.4 , pp. 259-277
    • Arcus, A.L.1
  • 3
    • 0027675494 scopus 로고
    • Balancing two-sided assembly lines: A case study
    • Bartholdi J.J. Balancing two-sided assembly lines: A case study. Int. J. Product. Res. 31 (1993) 2447-2461
    • (1993) Int. J. Product. Res. , vol.31 , pp. 2447-2461
    • Bartholdi, J.J.1
  • 4
    • 84974691270 scopus 로고    scopus 로고
    • Ant algorithms for assembly line balancing
    • Bautista J., and Pereira J. Ant algorithms for assembly line balancing. Lect. Notes Comput. Sci. 2463 (2002) 65-75
    • (2002) Lect. Notes Comput. Sci. , vol.2463 , pp. 65-75
    • Bautista, J.1    Pereira, J.2
  • 5
    • 33751255097 scopus 로고    scopus 로고
    • Ant algorithms for a time and space constrained assembly line balancing problem
    • Bautista J., and Pereira J. Ant algorithms for a time and space constrained assembly line balancing problem. Eur. J. Oper. Res. 177 (2007) 2016-2032
    • (2007) Eur. J. Oper. Res. , vol.177 , pp. 2016-2032
    • Bautista, J.1    Pereira, J.2
  • 7
    • 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. Manage. Sci. 32 (1986) 909-932
    • (1986) Manage. Sci. , vol.32 , pp. 909-932
    • Baybars, I.1
  • 8
    • 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. Eur. J. Oper. Res. 168 (2006) 694-715
    • (2006) Eur. J. Oper. Res. , vol.168 , pp. 694-715
    • Becker, C.1    Scholl, A.2
  • 9
    • 0026851799 scopus 로고
    • Branch-and-bound algorithms for the multi-product assembly line balancing problem
    • Berger I., Bourjolly J., and Laporte G. Branch-and-bound algorithms for the multi-product assembly line balancing problem. Eur. J. Oper. Res. 58 (1992) 215-222
    • (1992) Eur. J. Oper. Res. , vol.58 , pp. 215-222
    • Berger, I.1    Bourjolly, J.2    Laporte, G.3
  • 10
  • 11
    • 0000416102 scopus 로고
    • Assembly-line balancing by linear programming
    • Bowman E. Assembly-line balancing by linear programming. Oper. Res. 8 (1960) 385-389
    • (1960) Oper. Res. , vol.8 , pp. 385-389
    • Bowman, E.1
  • 12
    • 34548399728 scopus 로고    scopus 로고
    • A versatile algorithm for assembly line balancing
    • Boysen N., and Fliedner M. A versatile algorithm for assembly line balancing. Eur. J. Oper. Res. 184 (2008) 39-55
    • (2008) Eur. J. Oper. Res. , vol.184 , pp. 39-55
    • Boysen, N.1    Fliedner, M.2
  • 13
    • 34249995941 scopus 로고    scopus 로고
    • A classification of assembly line balancing problems
    • Boysen N., Fliedner M., and Scholl A. A classification of assembly line balancing problems. Eur. J. Oper. Res. 183 (2007) 674-693
    • (2007) Eur. J. Oper. Res. , vol.183 , pp. 674-693
    • Boysen, N.1    Fliedner, M.2    Scholl, A.3
  • 14
    • 37349007853 scopus 로고    scopus 로고
    • Assembly line balancing: Which model to use when?
    • Boysen N., Fliedner M., and Scholl A. Assembly line balancing: Which model to use when?. Int. J. Product. Econ. 111 (2008) 509-528
    • (2008) Int. J. Product. Econ. , vol.111 , pp. 509-528
    • Boysen, N.1    Fliedner, M.2    Scholl, A.3
  • 15
    • 0016027179 scopus 로고
    • Assembly line balancing with multiple stations
    • Buxey G.M. Assembly line balancing with multiple stations. Manage. Sci. 20 (1974) 1010-1021
    • (1974) Manage. Sci. , vol.20 , pp. 1010-1021
    • Buxey, G.M.1
  • 16
    • 0020178733 scopus 로고
    • The one-machine sequencing problem
    • Carlier J. The one-machine sequencing problem. Eur. J. Oper. Res. 11 (1982) 42-47
    • (1982) Eur. J. Oper. Res. , vol.11 , pp. 42-47
    • Carlier, J.1
  • 17
    • 0035480374 scopus 로고    scopus 로고
    • Incorporating physical demand criteria into assembly line balancing
    • Carnahan B.J., Norman B.A., and Redfern M.S. Incorporating physical demand criteria into assembly line balancing. IIE Trans. 33 (2001) 875-887
    • (2001) IIE Trans. , vol.33 , pp. 875-887
    • Carnahan, B.J.1    Norman, B.A.2    Redfern, M.S.3
  • 18
    • 0004533456 scopus 로고
    • MUST - A multiple solutions technique for balancing single model assembly lines
    • Dar-El E., and Rubinovitch Y. MUST - A multiple solutions technique for balancing single model assembly lines. Manage. Sci. 25 (1979) 1105-1114
    • (1979) Manage. Sci. , vol.25 , pp. 1105-1114
    • Dar-El, E.1    Rubinovitch, Y.2
  • 19
    • 0024683477 scopus 로고
    • Balancing cycle time and workstations
    • Deckro R.F. Balancing cycle time and workstations. IIE Trans. 21 (1989) 106-111
    • (1989) IIE Trans. , vol.21 , pp. 106-111
    • Deckro, R.F.1
  • 20
    • 0032117097 scopus 로고    scopus 로고
    • A survey of the assembly line balancing procedures
    • Erel E., and Sarin S.C. A survey of the assembly line balancing procedures. Product. Plan. Control 9 (1998) 414-434
    • (1998) Product. Plan. Control , vol.9 , pp. 414-434
    • Erel, E.1    Sarin, S.C.2
  • 21
    • 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. Eur. J. Oper. Res. 145 (2003) 606-620
    • (2003) Eur. J. Oper. Res. , vol.145 , pp. 606-620
    • Fleszar, K.1    Hindi, K.S.2
  • 22
    • 0034690556 scopus 로고    scopus 로고
    • A cutting plane approach for the single-product assembly system design problem
    • Gadidov R., and Wilhelm W. A cutting plane approach for the single-product assembly system design problem. Int. J. Product. Res. 38 (2000) 1731-1754
    • (2000) Int. J. Product. Res. , vol.38 , pp. 1731-1754
    • Gadidov, R.1    Wilhelm, W.2
  • 23
    • 0024641634 scopus 로고
    • A comprehensive literature review and analysis of the design, balancing and scheduling of assembly line systems
    • Ghosh S., and Gagnon R.J. A comprehensive literature review and analysis of the design, balancing and scheduling of assembly line systems. Int. J. Product. Res. 27 (1989) 637-670
    • (1989) Int. J. Product. Res. , vol.27 , pp. 637-670
    • Ghosh, S.1    Gagnon, R.J.2
  • 24
    • 0030785015 scopus 로고    scopus 로고
    • A goal programming approach to mixed-model assembly line balancing problem
    • Gökcen H., and Erel E. A goal programming approach to mixed-model assembly line balancing problem. Int. J. Product. Econ. 48 (1997) 177-185
    • (1997) Int. J. Product. Econ. , vol.48 , pp. 177-185
    • Gökcen, H.1    Erel, E.2
  • 25
    • 25144466582 scopus 로고
    • Taktabstimmung bei Fließarbeit mit dem Positionswert-Verfahren
    • Hautsch K., John H., and Schürgers H. Taktabstimmung bei Fließarbeit mit dem Positionswert-Verfahren. REFA-Nachrichten 25 (1972) 451-464
    • (1972) REFA-Nachrichten , vol.25 , pp. 451-464
    • Hautsch, K.1    John, H.2    Schürgers, H.3
  • 26
    • 0000804223 scopus 로고
    • A computing procedure for a line balancing problem
    • Jackson J.R. A computing procedure for a line balancing problem. Manage. Sci. 3 (1956) 261-271
    • (1956) Manage. Sci. , vol.3 , pp. 261-271
    • Jackson, J.R.1
  • 27
    • 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. Manage. Sci. 29 (1983) 1309-1324
    • (1983) Manage. Sci. , vol.29 , pp. 1309-1324
    • Johnson, R.V.1
  • 28
    • 0023963644 scopus 로고
    • Optimally balancing large assembly lines with FABLE
    • Johnson R.V. Optimally balancing large assembly lines with FABLE. Manage. Sci. 34 (1988) 240-253
    • (1988) Manage. Sci. , vol.34 , pp. 240-253
    • Johnson, R.V.1
  • 29
    • 0026173740 scopus 로고
    • Balancing assembly lines for teams and work groups
    • Johnson R.V. Balancing assembly lines for teams and work groups. Int. J. Product. Res. 29 (1991) 1205-1214
    • (1991) Int. J. Product. Res. , vol.29 , pp. 1205-1214
    • Johnson, R.V.1
  • 30
    • 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. Product. Plan. Control 11 (2000) 44-53
    • (2000) Product. Plan. Control , vol.11 , pp. 44-53
    • Kim, Y.K.1    Kim, Y.2    Kim, Y.J.3
  • 31
    • 0029358711 scopus 로고
    • A strong cutting plane algorithm for the robotic assembly line balancing problem
    • Kim H., and Park S. A strong cutting plane algorithm for the robotic assembly line balancing problem. Int. J. Product. Res. 33 (1995) 2311-2323
    • (1995) Int. J. Product. Res. , vol.33 , pp. 2311-2323
    • Kim, H.1    Park, S.2
  • 32
    • 0032709489 scopus 로고    scopus 로고
    • Computing lower bounds by destructive improvement-An application to resource-constrained project scheduling
    • Klein R., and Scholl A. Computing lower bounds by destructive improvement-An application to resource-constrained project scheduling. Eur. J. Oper. Res. 112 (1999) 322-346
    • (1999) Eur. J. Oper. Res. , vol.112 , pp. 322-346
    • Klein, R.1    Scholl, A.2
  • 34
    • 3042688706 scopus 로고    scopus 로고
    • Balancing assembly lines: An industrial case study
    • Lapierre S.D., and Ruiz A.B. Balancing assembly lines: An industrial case study. J. Oper. Res. Soc. 55 (2004) 589-597
    • (2004) J. Oper. Res. Soc. , vol.55 , pp. 589-597
    • Lapierre, S.D.1    Ruiz, A.B.2
  • 35
    • 25144457210 scopus 로고    scopus 로고
    • Balancing assembly lines with tabu search
    • Lapierre S.D., Ruiz A., and Soriano P. Balancing assembly lines with tabu search. Eur. J. Oper. Res. 168 (2006) 826-837
    • (2006) Eur. J. Oper. Res. , vol.168 , pp. 826-837
    • Lapierre, S.D.1    Ruiz, A.2    Soriano, P.3
  • 36
    • 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. Comput. Ind. Eng. 40 (2001) 273-292
    • (2001) Comput. Ind. Eng. , vol.40 , pp. 273-292
    • Lee, T.O.1    Kim, Y.2    Kim, Y.K.3
  • 37
    • 84990609518 scopus 로고
    • Assembly line balancing using genetic algorithms with heuristic generated initial populations and multiple evaluation criteria
    • Leu Y.Y., Matheson L.A., and Rees L.P. Assembly line balancing using genetic algorithms with heuristic generated initial populations and multiple evaluation criteria. Decision Sci. 25 (1994) 581-606
    • (1994) Decision Sci. , vol.25 , pp. 581-606
    • Leu, Y.Y.1    Matheson, L.A.2    Rees, L.P.3
  • 38
    • 0036658173 scopus 로고    scopus 로고
    • Multi-section electronic assembly line balancing problems: A case study
    • Liu C.M., and Chen C.H. Multi-section electronic assembly line balancing problems: A case study. Product. Plan. Control 13 (2002) 451-461
    • (2002) Product. Plan. Control , vol.13 , pp. 451-461
    • Liu, C.M.1    Chen, C.H.2
  • 39
    • 0030241346 scopus 로고    scopus 로고
    • A knowledge-based system for solving multi-objective assembly line balancing problems
    • Malakooti B., and Kumar A. A knowledge-based system for solving multi-objective assembly line balancing problems. Int. J. Product. Res. 34 (1996) 2533-2552
    • (1996) Int. J. Product. Res. , vol.34 , pp. 2533-2552
    • Malakooti, B.1    Kumar, A.2
  • 40
    • 0002134614 scopus 로고    scopus 로고
    • Balancing U-lines in a multiple U-line facility
    • Miltenburg J. Balancing U-lines in a multiple U-line facility. Eur. J. Oper. Res. 109 (1998) 1-23
    • (1998) Eur. J. Oper. Res. , vol.109 , pp. 1-23
    • Miltenburg, J.1
  • 41
    • 33645140019 scopus 로고    scopus 로고
    • Optimally balancing large assembly lines: Updating Johnson's 1988 FABLE algorithm
    • Miltenburg J. Optimally balancing large assembly lines: Updating Johnson's 1988 FABLE algorithm. INFOR: Inform. Syst. Oper. Res. 44 (2006) 23-47
    • (2006) INFOR: Inform. Syst. Oper. Res. , vol.44 , pp. 23-47
    • Miltenburg, J.1
  • 42
    • 69749125468 scopus 로고    scopus 로고
    • Solving procedures for the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
    • Colombia
    • Miralles, C., 2005. Solving procedures for the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled. In: XI Escuela Latinoamericana de Verano en Investigacion de Operaciones, Villa de Leyva, Colombia. .
    • (2005) XI Escuela Latinoamericana de Verano en Investigacion de Operaciones, Villa de Leyva
    • Miralles, C.1
  • 43
    • 0000436404 scopus 로고
    • Finding optimal line balances with OptPack
    • Nourie F.J., and Venta E.R. Finding optimal line balances with OptPack. Oper. Res. Lett. 10 (1991) 165-171
    • (1991) Oper. Res. Lett. , vol.10 , pp. 165-171
    • Nourie, F.J.1    Venta, E.R.2
  • 44
    • 0031122267 scopus 로고    scopus 로고
    • A heuristic for an assembly line balancing problem with incompatibility, range, and partial precedence constraints
    • Park K., Park S., and Kim W. A heuristic for an assembly line balancing problem with incompatibility, range, and partial precedence constraints. Comput. Ind. Eng. 32 (1997) 321-332
    • (1997) Comput. Ind. Eng. , vol.32 , pp. 321-332
    • Park, K.1    Park, S.2    Kim, W.3
  • 45
    • 0036902263 scopus 로고    scopus 로고
    • Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion
    • Pastor R., Andres C., Duran A., and Perez M. Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion. J. Oper. Res. Soc. 53 (2002) 1317-1323
    • (2002) J. Oper. Res. Soc. , vol.53 , pp. 1317-1323
    • Pastor, R.1    Andres, C.2    Duran, A.3    Perez, M.4
  • 46
    • 25144441275 scopus 로고    scopus 로고
    • Assembly line balancing with incompatibilities and bounded workstation loads
    • Pastor R., and Corominas A. Assembly line balancing with incompatibilities and bounded workstation loads. Ric. Oper. 30 (2000) 23-45
    • (2000) Ric. Oper. , vol.30 , pp. 23-45
    • Pastor, R.1    Corominas, A.2
  • 47
    • 36849019162 scopus 로고    scopus 로고
    • Different ways of modelling and solving precedence and incompatibility constraints in the assembly line balancing problem
    • Pastor R., Corominas A., and Lusa A. Different ways of modelling and solving precedence and incompatibility constraints in the assembly line balancing problem. Front. Artif. Intell. Appl. 113 (2004) 359-366
    • (2004) Front. Artif. Intell. Appl. , vol.113 , pp. 359-366
    • Pastor, R.1    Corominas, A.2    Lusa, A.3
  • 48
    • 0016428867 scopus 로고
    • Assembly-line balancing: Zero-one programming with Fibonacci search
    • Patterson J.H., and Albracht J.J. Assembly-line balancing: Zero-one programming with Fibonacci search. Oper. Res. 23 (1975) 166-172
    • (1975) Oper. Res. , vol.23 , pp. 166-172
    • Patterson, J.H.1    Albracht, J.J.2
  • 49
    • 0030823620 scopus 로고    scopus 로고
    • A family of hierarchical models for assembly system design
    • Pinnoi A., and Wilhelm W.E. A family of hierarchical models for assembly system design. Int. J. Product. Res. 35 (1997) 253-280
    • (1997) Int. J. Product. Res. , vol.35 , pp. 253-280
    • Pinnoi, A.1    Wilhelm, W.E.2
  • 50
    • 0019899326 scopus 로고
    • A new method for assembly line balancing having stochastic work elements
    • Raouf A., and Tsui C. A new method for assembly line balancing having stochastic work elements. Comput. Ind. Eng. 6 (1982) 131-148
    • (1982) Comput. Ind. Eng. , vol.6 , pp. 131-148
    • Raouf, A.1    Tsui, C.2
  • 52
    • 0037139671 scopus 로고    scopus 로고
    • Hybrid assembly line design and user's preferences
    • Rekiek B., de Lit P., and Delchambre A. Hybrid assembly line design and user's preferences. Int. J. Product. Res. 40 (2002) 1095-1111
    • (2002) Int. J. Product. Res. , vol.40 , pp. 1095-1111
    • Rekiek, B.1    de Lit, P.2    Delchambre, A.3
  • 53
    • 84960656106 scopus 로고
    • On a multiproduct assembly line-balancing problem
    • Roberts S.D., and Villa C.D. On a multiproduct assembly line-balancing problem. AIIE Trans. 2 (1970) 361-364
    • (1970) AIIE Trans. , vol.2 , pp. 361-364
    • Roberts, S.D.1    Villa, C.D.2
  • 54
    • 0023428683 scopus 로고
    • A two-process implicit enumeration algorithm for the simple assembly line balancing problem
    • Saltzman M.J., and Baybars I. A two-process implicit enumeration algorithm for the simple assembly line balancing problem. Eur. J. Oper. Res. 32 (1987) 118-129
    • (1987) Eur. J. Oper. Res. , vol.32 , pp. 118-129
    • Saltzman, M.J.1    Baybars, I.2
  • 55
    • 0037121160 scopus 로고    scopus 로고
    • Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
    • Sawik T. Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line. Eur. J. Oper. Res. 143 (2002) 115-124
    • (2002) Eur. J. Oper. Res. , vol.143 , pp. 115-124
    • Sawik, T.1
  • 56
    • 0018672309 scopus 로고
    • Assembly line balancing and the application of computer techniques
    • Schofield N.A. Assembly line balancing and the application of computer techniques. Comput. Ind. Eng. 3 (1979) 53-59
    • (1979) Comput. Ind. Eng. , vol.3 , pp. 53-59
    • Schofield, N.A.1
  • 58
    • 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. Eur. J. Oper. Res. 168 (2006) 666-693
    • (2006) Eur. J. Oper. Res. , vol.168 , pp. 666-693
    • Scholl, A.1    Becker, C.2
  • 59
    • 43449085514 scopus 로고    scopus 로고
    • The sequence-dependent assembly line balancing problem
    • Scholl A., Boysen N., and Fliedner M. The sequence-dependent assembly line balancing problem. OR Spectrum 30 (2008) 579-609
    • (2008) OR Spectrum , vol.30 , pp. 579-609
    • Scholl, A.1    Boysen, N.2    Fliedner, M.3
  • 60
    • 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 J. Comput. 9 (1997) 319-334
    • (1997) Informs J. Comput. , vol.9 , pp. 319-334
    • Scholl, A.1    Klein, R.2
  • 61
    • 0033115142 scopus 로고    scopus 로고
    • Balancing assembly lines effectively - A computational comparison
    • Scholl A., and Klein R. Balancing assembly lines effectively - A computational comparison. Eur. J. Oper. Res. 114 (1999) 50-58
    • (1999) Eur. J. Oper. Res. , vol.114 , pp. 50-58
    • Scholl, A.1    Klein, R.2
  • 62
    • 0032635871 scopus 로고    scopus 로고
    • A competitive branch-and-bound algorithm for the simple assembly line balancing problem
    • Sprecher A. A competitive branch-and-bound algorithm for the simple assembly line balancing problem. Int. J. Product. Res. 37 (1999) 1787-1816
    • (1999) Int. J. Product. Res. , vol.37 , pp. 1787-1816
    • Sprecher, A.1
  • 63
    • 0010549168 scopus 로고
    • Assembly line balancing by zero-one integer programming
    • Thangavelu S.R., and Shetty C.M. Assembly line balancing by zero-one integer programming. AIIE Trans. 3 (1971) 61-68
    • (1971) AIIE Trans. , vol.3 , pp. 61-68
    • Thangavelu, S.R.1    Shetty, C.M.2
  • 64
    • 0037091985 scopus 로고    scopus 로고
    • A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations
    • Vilarinho P.M., and Simaria A.S. A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations. Int. J. Product. Res. 40 (2002) 1405-1420
    • (2002) Int. J. Product. Res. , vol.40 , pp. 1405-1420
    • Vilarinho, P.M.1    Simaria, A.S.2
  • 65
    • 29344441733 scopus 로고    scopus 로고
    • ANTBAL: An ant colony optimization algorithm for balancing mixed-model assembly lines with parallel workstations
    • Vilarinho P.M., and Simaria A.S. ANTBAL: An ant colony optimization algorithm for balancing mixed-model assembly lines with parallel workstations. Int. J. Product. Res. 44 (2006) 291-303
    • (2006) Int. J. Product. Res. , vol.44 , pp. 291-303
    • Vilarinho, P.M.1    Simaria, A.S.2
  • 66
    • 0020116655 scopus 로고
    • Assembly line balancing as generalized bin packing
    • Wee T.S., and Magazine M.J. Assembly line balancing as generalized bin packing. Oper. Res. Lett. 1/2 (1982) 56-58
    • (1982) Oper. Res. Lett. , vol.1-2 , pp. 56-58
    • Wee, T.S.1    Magazine, M.J.2
  • 67
    • 0000028230 scopus 로고
    • Comments on a paper by Bowman
    • White W.W. Comments on a paper by Bowman. Oper. Res. 9 (1961) 274-276
    • (1961) Oper. Res. , vol.9 , pp. 274-276
    • White, W.W.1
  • 68
    • 3843151430 scopus 로고    scopus 로고
    • A branch-and-cut approach for a generic multiple-product, assembly-system design problem
    • Wilhelm W.E., and Gadidov R. A branch-and-cut approach for a generic multiple-product, assembly-system design problem. Informs J. Comput. 16 (2004) 39-55
    • (2004) Informs J. Comput. , vol.16 , pp. 39-55
    • Wilhelm, W.E.1    Gadidov, R.2


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