메뉴 건너뛰기




Volumn 4150 LNCS, Issue , 2006, Pages 96-107

Beam-ACO applied to assembly line balancing

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED MANUFACTURING; COMPUTER WORKSTATIONS; KNOWLEDGE ENGINEERING; PROBLEM SOLVING; PRODUCT DESIGN;

EID: 33751359610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11839088_9     Document Type: Conference Paper
Times cited : (18)

References (20)
  • 1
    • 25144482035 scopus 로고    scopus 로고
    • State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
    • Scholl, A., Becker, C.: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research 168(3) (2006) 666-693
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 666-693
    • Scholl, A.1    Becker, C.2
  • 3
    • 0022699406 scopus 로고
    • A comparative evaluation of heuristic line balancing techniques
    • Talbot, F.B., Patterson, J.H., Gehrlein, J.H.: A comparative evaluation of heuristic line balancing techniques. Management Science 32 (1986) 430-454
    • (1986) Management Science , vol.32 , pp. 430-454
    • Talbot, F.B.1    Patterson, J.H.2    Gehrlein, J.H.3
  • 4
    • 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
  • 5
    • 0026487247 scopus 로고
    • EUREKA: A hybrid system for assembly line balancing
    • Hoffmann, T.R.: EUREKA: A hybrid system for assembly line balancing. Management Science 38 (1992) 39-47
    • (1992) Management Science , vol.38 , pp. 39-47
    • Hoffmann, T.R.1
  • 6
    • 0001193704 scopus 로고    scopus 로고
    • SALOME: A bidirectional branch and bound procedure for assembly line balancing
    • Scholl, A., 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
  • 7
    • 0242301590 scopus 로고    scopus 로고
    • Dynamic search tree decomposition for balancing assembly lines by parallel search
    • Sprecher, A.: Dynamic search tree decomposition for balancing assembly lines by parallel search. International Journal of Production Research 41 (2003) 1423-1430
    • (2003) International Journal of Production Research , vol.41 , pp. 1423-1430
    • Sprecher, A.1
  • 8
    • 0031543416 scopus 로고    scopus 로고
    • Simple assembly line balancing-Heuristic approaches
    • Scholl, A., Voss, 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    Voss, S.2
  • 10
    • 0037091985 scopus 로고    scopus 로고
    • A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations
    • Vilarinho, P.M., Simaria, A.: A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations. International Journal of Production Research (2002) 1405-1420
    • (2002) International Journal of Production Research , pp. 1405-1420
    • Vilarinho, P.M.1    Simaria, A.2
  • 11
    • 0036845392 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for assembly line balancing
    • Gonçalves, J.F., de Almeida, J.R.: A hybrid genetic algorithm for assembly line balancing. Journal of Heuristics 8 (2002) 629-642
    • (2002) Journal of Heuristics , vol.8 , pp. 629-642
    • Gonçalves, J.F.1    De Almeida, J.R.2
  • 12
    • 84974691270 scopus 로고    scopus 로고
    • Ant algorithms for assembly line balancing
    • Dorigo, M., Di Caro, G., Sampels, M., eds.: Ant Algorithms - Proceedings of ANTS 2002 - Third International Workshop. Springer Verlag, Berlin, Germany
    • Bautista, J., Pereira, J.: Ant algorithms for assembly line balancing. In Dorigo, M., Di Caro, G., Sampels, M., eds.: Ant Algorithms - Proceedings of ANTS 2002 - Third International Workshop. Volume 2463 of Lecture Notes in Computer Science., Springer Verlag, Berlin, Germany (2002) 65-75
    • (2002) Lecture Notes in Computer Science , vol.2463 , pp. 65-75
    • Bautista, J.1    Pereira, J.2
  • 13
    • 33751366825 scopus 로고    scopus 로고
    • Ant algorithms for a time and space constrained assembly line balancing problem
    • In press
    • Bautista, J., Pereira, J.: Ant algorithms for a time and space constrained assembly line balancing problem. European Journal of Operational Research (2006) In press.
    • (2006) European Journal of Operational Research
    • Bautista, J.1    Pereira, J.2
  • 15
    • 9544220684 scopus 로고    scopus 로고
    • Beam-ACO - Hybridizing ant colony optimization with beam search: An application to open shop scheduling
    • Blum, C.: Beam-ACO - Hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers & Operations Research 32(6) (2005) 1565-1591
    • (2005) Computers & Operations Research , vol.32 , Issue.6 , pp. 1565-1591
    • Blum, C.1
  • 17
    • 26944493012 scopus 로고    scopus 로고
    • Parametrized greedy heuristics in theory and practice
    • Blesa, M.J., Blum, C., Roli, A., Sampels, M., eds.: Proceedings of HM 2005 - 2nd International Workshop on Hybrid Metaheuristics. Springer Verlag, Berlin, Germany
    • Fügenschuh, A.: Parametrized greedy heuristics in theory and practice. In Blesa, M.J., Blum, C., Roli, A., Sampels, M., eds.: Proceedings of HM 2005 - 2nd International Workshop on Hybrid Metaheuristics. Volume 3636 of Lecture Notes in Computer Science., Springer Verlag, Berlin, Germany (2005) 21-31
    • (2005) Lecture Notes in Computer Science , vol.3636 , pp. 21-31
    • Fügenschuh, A.1
  • 19
    • 84958631637 scopus 로고    scopus 로고
    • An ant algorithm with a new pheromone evaluation rule for total tardiness problems
    • Proceedings of the EvoWorkshops 2000. Springer Verlag, Berlin, Germany
    • Merkle, D., Middendorf, M.: An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the EvoWorkshops 2000. Volume 1803 of Lecture Notes in Computer Science., Springer Verlag, Berlin, Germany (2000) 287-296
    • (2000) Lecture Notes in Computer Science , vol.1803 , pp. 287-296
    • Merkle, D.1    Middendorf, M.2


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