@inproceedings{0d29bf9933b94d8d9353f6412594f36e,
title = "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.",
author = "Joaqu{\'i}n Bautista and Jordi Pereira",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 3rd International Workshop on Ant Algorithms, ANTS 2002 ; Conference date: 12-09-2002 Through 14-09-2002",
year = "2002",
doi = "10.1007/3-540-45724-0_6",
language = "English",
isbn = "9783540457244",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "65--75",
editor = "{Dorigo }, Marco and {di Caro}, Gianni and Michael Sampels",
booktitle = "Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings",
}