Ant algorithms for assembly line balancing
Abstract
The present work is focused on the assembly line balancing design problems whose objective is to minimize the number of stations needed to manufacture a product in a line given a fixed cycle time, equivalent to a fixed production rate. The problem is solved using an ACO metaheuristic implementation with different features, obtaining good results. Afterwards, an adaptation of the previous implementation is used to solve a real case problem found in a bike assembly line with a hierarchical multi-objective function and additional constraints between tasks.
Más información
Editorial: | Springer |
Fecha de publicación: | 2002 |
Año de Inicio/Término: | September 12 - 14, 2002 |
Página de inicio: | 65 |
Página final: | 75 |
Idioma: | English |
URL: | http://link.springer.com/chapter/10.1007%2F3-540-45724-0_6 |
DOI: |
10.1007/3-540-45724-0_6 |
Notas: | indexed by scopus |