메뉴 건너뛰기




Volumn 5818 LNCS, Issue , 2009, Pages 1-14

Hybrid metaheuristic for the assembly line worker assignment and balancing problem

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY LINE; ASSEMBLY-LINE WORKERS; BALANCING PROBLEMS; COMPUTATIONAL RESULTS; HYBRID METHOD; ITERATED LOCAL SEARCH; LOCAL SEARCH HEURISTICS; METAHEURISTIC; NP-HARD; OPERATION TIME; SEARCH SPACES;

EID: 71049172929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04918-7_1     Document Type: Conference Paper
Times cited : (39)

References (20)
  • 3
    • 47349120657 scopus 로고    scopus 로고
    • Hybrid evolutionary algorithms and clustering search
    • Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Springer, Heidelberg
    • Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. In: Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Hybrid Evolutionary Systems - Studies in Computational Intelligence, pp. 81-102. Springer, Heidelberg (2007)
    • (2007) Hybrid Evolutionary Systems - Studies in Computational Intelligence , pp. 81-102
    • Oliveira, A.C.M.1    Lorena, L.A.N.2
  • 4
    • 61349146608 scopus 로고    scopus 로고
    • Clustering search heuristic for the capacitated p-median problem
    • Chaves, A.A., Lorena, L.A.N., Corrêa, F.A.: Clustering search heuristic for the capacitated p-median problem. Advances in Soft Computing 44, 136-143 (2008)
    • (2008) Advances in Soft Computing , vol.44 , pp. 136-143
    • Chaves, A.A.1    Lorena, L.A.N.2    Corrêa, F.A.3
  • 6
    • 38049000847 scopus 로고    scopus 로고
    • Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
    • Miralles, C., Garć?a-Sabater, J.P., Andŕes, C., Card́os, M.: Branch and bound procedures for solving the assembly line worker assignment and balancing problem: application to sheltered work centres for disabled. Discrete Applied Mathematics 156(3), 352-367 (2008)
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.3 , pp. 352-367
    • Miralles, C.1    Garća-Sabater, J.P.2    Andŕes, C.3    Card́os, M.4
  • 8
    • 71049190975 scopus 로고    scopus 로고
    • Uma meta-heuŕ?stica h́?brida aplicada ao problema de balanceamento e designa̧cão de trabalhadores em linha de produ̧cão
    • João Pessoa, Brazil
    • Chaves, A.A., Miralles, C., Lorena, L.A.N.: Uma meta-heuŕ?stica h́?brida aplicada ao problema de balanceamento e designa̧cão de trabalhadores em linha de produ̧cão. In: Proceedings of XL Simṕosio Brasileiro de Pesquisa Operacional, João Pessoa, Brazil, pp. 143-152 (2008)
    • (2008) Proceedings of XL Simṕosio Brasileiro de Pesquisa Operacional , pp. 143-152
    • Chaves, A.A.1    Miralles, C.2    Lorena, L.A.N.3
  • 9
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick, S., Gellat, D.C., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671-680 (1983)
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gellat, D.C.2    Vecchi, M.P.3
  • 10
    • 0022768294 scopus 로고
    • 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, 909-932 (1986) (Pubitemid 16612186)
    • (1986) Management Science , vol.32 , Issue.8 , pp. 909-932
    • Baybars Ilker1
  • 14
    • 0001853336 scopus 로고    scopus 로고
    • Tabu search and adaptive memory programming
    • Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Kluwer, Dordrecht
    • Glover, F.: Tabu search and adaptive memory programing. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1-75. Kluwer, Dordrecht (1996)
    • (1996) Interfaces in Computer Science and Operations Research , pp. 1-75
    • Glover, F.1
  • 16
  • 19
    • 47349123411 scopus 로고    scopus 로고
    • Hybrid metaheuristic for the prize collecting travelling salesman problem
    • van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. Springer, Heidelberg
    • Chaves, A.A., Lorena, L.A.N.: Hybrid metaheuristic for the prize collecting travelling salesman problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol.4972, pp. 123-134. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4972 , pp. 123-134
    • Chaves, A.A.1    Lorena, L.A.N.2
  • 20
    • 38149111166 scopus 로고    scopus 로고
    • Evolutionary clustering search for flowtime minimization in permutation flow shop
    • Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. Springer, Heidelberg
    • Filho, G.R., Nagano, M.S., Lorena, L.A.N.: Evolutionary clustering search for flowtime minimization in permutation flow shop. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol.4771, pp. 69-81. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4771 , pp. 69-81
    • Filho, G.R.1    Nagano, M.S.2    Lorena, L.A.N.3


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