메뉴 건너뛰기




Volumn 45, Issue , 2014, Pages 87-96

A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem

Author keywords

Assembly Line Balancing; Beam search; Branch and bound; Heterogeneous workers; MIP

Indexed keywords

ASSEMBLY LINE BALANCING; BEAM SEARCH; BRANCH AND BOUNDS; HETEROGENEOUS WORKERS; MIP;

EID: 84892557305     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.12.002     Document Type: Article
Times cited : (91)

References (32)
  • 3
    • 79959977158 scopus 로고    scopus 로고
    • World Health Organization
    • World Health Organization. World report on disability; 2011. URL 〈 http://www.who.int/disabilities/world-report âŒ.
    • (2011) World Report on Disability
  • 6
    • 34548510141 scopus 로고    scopus 로고
    • Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study
    • C. Miralles, J.P. García-Sabater, C. Andrés, and M. Cardos Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study Int J Prod Econ 110 1-2 2007 187 197
    • (2007) Int J Prod Econ , vol.110 , Issue.12 , pp. 187-197
    • Miralles, C.1    García-Sabater, J.P.2    Andrés, C.3    Cardos, M.4
  • 7
    • 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 Eur J Oper Res 168 3 2006 666 693
    • (2006) Eur J Oper Res , vol.168 , Issue.3 , pp. 666-693
    • Scholl, A.1    Becker, C.2
  • 8
    • 0013055270 scopus 로고    scopus 로고
    • A single-run optimization algorithm for stochastic assembly line balancing problems
    • J. Lyu A single-run optimization algorithm for stochastic assembly line balancing problems J Manuf Syst 16 3 1997 204 210
    • (1997) J Manuf Syst , vol.16 , Issue.3 , pp. 204-210
    • Lyu, J.1
  • 9
    • 33748934553 scopus 로고    scopus 로고
    • The stochastic U-line balancing problem a heuristic procedure
    • 10.1016/j.ejor.2004.10.031
    • W.C. Chiang, and T.L. Urban The stochastic U-line balancing problem a heuristic procedure Eur J Oper Res 175 2006 1767 1781 10.1016/j.ejor.2004.10.031
    • (2006) Eur J Oper Res , vol.175 , pp. 1767-1781
    • Chiang, W.C.1    Urban, T.L.2
  • 10
    • 27744559270 scopus 로고    scopus 로고
    • Stochastic assembly line balancing using beam search
    • 10.1080/00207540412331320526
    • E. Erel, I. Sabuncuoglu, and H. Sekerci Stochastic assembly line balancing using beam search Int J Prod Res 43 7 2005 1411 1426 10.1080/00207540412331320526
    • (2005) Int J Prod Res , vol.43 , Issue.7 , pp. 1411-1426
    • Erel, E.1    Sabuncuoglu, I.2    Sekerci, H.3
  • 11
    • 11144304066 scopus 로고    scopus 로고
    • A bidirectional heuristic for stochastic assembly line balancing type II problem
    • 10.1007/s00170-003-1833-5
    • S.B. Liu, H.L. Ong, and H.C. Huang A bidirectional heuristic for stochastic assembly line balancing type II problem Int J Adv Manuf Technol 25 2005 10.1007/s00170-003-1833-5
    • (2005) Int J Adv Manuf Technol , vol.25
    • Liu, S.B.1    Ong, H.L.2    Huang, H.C.3
  • 12
    • 78650589919 scopus 로고    scopus 로고
    • A genetic algorithm for the stochastic mixed-model u-line balancing and sequencing problem
    • U. Özcan, T. KellegÃz, and B. Toklu A genetic algorithm for the stochastic mixed-model u-line balancing and sequencing problem Int J Prod Res 49 6 2011
    • (2011) Int J Prod Res , vol.49 , Issue.6
    • Özcan, U.1    Kellegãz, T.2    Toklu, B.3
  • 13
    • 25144450992 scopus 로고    scopus 로고
    • A survey on problems and methods in generalized assembly line balancing
    • C. Becker, and A. Scholl A survey on problems and methods in generalized assembly line balancing Eur J Oper Res 168 3 2006 694 715
    • (2006) Eur J Oper Res , vol.168 , Issue.3 , pp. 694-715
    • Becker, C.1    Scholl, A.2
  • 14
    • 38049000847 scopus 로고    scopus 로고
    • Branch and bound procedures for solving the assembly line worker assignment and balancing problem application to sheltered work centres for disabled
    • C. Miralles, J.P. García-Sabater, C. Andrés, and M. Cardós Branch and bound procedures for solving the assembly line worker assignment and balancing problem application to sheltered work centres for disabled Discrete Appl Math 156 3 2008 352 367
    • (2008) Discrete Appl Math , vol.156 , Issue.3 , pp. 352-367
    • Miralles, C.1    García-Sabater, J.P.2    Andrés, C.3    Cardós, M.4
  • 15
    • 84874540167 scopus 로고    scopus 로고
    • A taxonomy of line balancing problems and their solution approaches
    • 10.1016/j.ijpe.2012.10.020
    • O. Battaïa, and A. Dolgui A taxonomy of line balancing problems and their solution approaches Int J Prod Econ 143 2 2013 259 277 10.1016/j.ijpe.2012.10.020
    • (2013) Int J Prod Econ , vol.143 , Issue.2 , pp. 259-277
    • Battaïa, O.1    Dolgui, A.2
  • 16
    • 34249995941 scopus 로고    scopus 로고
    • A classification of assembly line balancing problems
    • 10.1016/j.ejor.2006.10.010
    • N. Boysen, M. Fliedner, and A. Scholl A classification of assembly line balancing problems Eur J Oper Res 183 2007 674 693 10.1016/j.ejor.2006.10.010
    • (2007) Eur J Oper Res , vol.183 , pp. 674-693
    • Boysen, N.1    Fliedner, M.2    Scholl, A.3
  • 17
    • 67651189516 scopus 로고    scopus 로고
    • Clustering search approach for the assembly line worker assignment and balancing problem
    • Chaves AA, Miralles C, Lorena LAN. Clustering search approach for the assembly line worker assignment and balancing problem. In: Proceedings of ICC &IE; 2007. p. 1469-78.
    • (2007) Proceedings of ICC &iE , pp. 1469-1478
    • Chaves, A.A.1    Miralles, C.2    Lorena, L.3
  • 18
    • 71049172929 scopus 로고    scopus 로고
    • Hybrid metaheuristic for the assembly line worker assignment and balancing problem
    • M. Blesa, C. Blum, L. Di-Gaspero, A. Roli, M. Sampels, A. Schaerf, Springer, Berlin/Heidelberg
    • A. Chaves, L. Lorena, and C. Miralles Hybrid metaheuristic for the assembly line worker assignment and balancing problem M. Blesa, C. Blum, L. Di-Gaspero, A. Roli, M. Sampels, A. Schaerf, Hybrid metaheuristics. Lecture notes in computer science vol. 5818 2009 Springer, Berlin/Heidelberg 1 14
    • (2009) Hybrid Metaheuristics. Lecture Notes in Computer Science , vol.5818 VOL. , pp. 1-14
    • Chaves, A.1    Lorena, L.2    Miralles, C.3
  • 20
    • 78049444965 scopus 로고    scopus 로고
    • On solving the assembly line worker assignment and balancing problem via beam search
    • C. Blum, and C. Miralles On solving the assembly line worker assignment and balancing problem via beam search Comput Oper Res 38 2 2011 328 339
    • (2011) Comput Oper Res , vol.38 , Issue.2 , pp. 328-339
    • Blum, C.1    Miralles, C.2
  • 21
    • 84862191686 scopus 로고    scopus 로고
    • Simple heuristics for the assembly line worker assignment and balancing problem
    • M. Moreira, M. Ritt, A. Costa, and A. Chaves Simple heuristics for the assembly line worker assignment and balancing problem J Heuristics 18 3 2012 505 524
    • (2012) J Heuristics , vol.18 , Issue.3 , pp. 505-524
    • Moreira, M.1    Ritt, M.2    Costa, A.3    Chaves, A.4
  • 22
    • 84866148241 scopus 로고    scopus 로고
    • An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
    • O. Mutlu, O. Polat, and A.A. Supciller An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II Comput Oper Res 40 1 2013 418 426
    • (2013) Comput Oper Res , vol.40 , Issue.1 , pp. 418-426
    • Mutlu, O.1    Polat, O.2    Supciller, A.A.3
  • 23
    • 84888215608 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for assembly line worker assignment and balancing problems
    • Vila M, Pereira J. A branch-and-bound algorithm for assembly line worker assignment and balancing problems. Comput Oper Res 2014;44:105-14, http://dx.doi.org/10.1016/j.cor.2013.10.016.
    • (2014) Comput Oper Res , vol.44 , pp. 105-114
    • Vila, M.1    Pereira, J.2
  • 24
    • 84867541884 scopus 로고    scopus 로고
    • A branch, bound, and remember algorithm for the simple assembly line balancing problem
    • 10.1287/ijoc.1110.0462
    • E.C. Sewell, and S.H. Jacobson A branch, bound, and remember algorithm for the simple assembly line balancing problem INFORMS J Comput 24 3 2012 433 442 10.1287/ijoc.1110.0462
    • (2012) INFORMS J Comput , vol.24 , Issue.3 , pp. 433-442
    • Sewell, E.C.1    Jacobson, S.H.2
  • 25
    • 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 Eur J Oper Res 168 2006 716 731
    • (2006) Eur J Oper Res , vol.168 , pp. 716-731
    • Peeters, M.1    Degraeve, Z.2
  • 26
    • 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 Eur J Oper Res 168 3 2006 666 693
    • (2006) Eur J Oper Res , vol.168 , Issue.3 , pp. 666-693
    • Scholl, A.1    Becker, C.2
  • 27
    • 0001679827 scopus 로고    scopus 로고
    • Exact and approximation algorithms for makespan minimization on unrelated parallel machines
    • S. Martello, F. Soumis, and P. Toth Exact and approximation algorithms for makespan minimization on unrelated parallel machines Discrete Appl Math 75 2 1997 169 188
    • (1997) Discrete Appl Math , vol.75 , Issue.2 , pp. 169-188
    • Martello, S.1    Soumis, F.2    Toth, P.3
  • 29
    • 0023844415 scopus 로고
    • Filtered beam search in scheduling
    • P.S. Ow, and T. Morton Filtered beam search in scheduling Int J Prod Econ 26 1 1988 35 62
    • (1988) Int J Prod Econ , vol.26 , Issue.1 , pp. 35-62
    • Ow, P.S.1    Morton, T.2
  • 30
    • 0023014930 scopus 로고
    • Amortized efficiency of a path retrieval data structure
    • 10.1016/0304-3975(86)90098-8
    • G.F. Italiano Amortized efficiency of a path retrieval data structure Theor Comput Sci 48 1986 273 281 10.1016/0304-3975(86)90098-8
    • (1986) Theor Comput Sci , vol.48 , pp. 273-281
    • Italiano, G.F.1
  • 31
    • 0000804104 scopus 로고
    • Duality-based algorithms for scheduling unrelated parallel machines
    • S.L. van de Velde Duality-based algorithms for scheduling unrelated parallel machines ORSA J Comput 1993 192 205
    • (1993) ORSA J Comput , pp. 192-205
    • Van De Velde, S.L.1
  • 32
    • 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 Eur J Oper Res 228 2013 33 45
    • (2013) Eur J Oper Res , vol.228 , pp. 33-45
    • Otto, A.1    Otto, C.2    Scholl, A.3


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