2026-04-13T07:00:10Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/913162025-07-17T14:39:43Zcom_2072_1033col_2072_452950

urn:hdl:2117/91316 Local search heuristics for the assembly line balancing problem with incompatibilities between tasks Bautista Valhondo, Joaquín Suárez Feijóo, Raúl Mateo Doll, Manuel Companys Pascual, Ramón Àrees temàtiques de la UPC::Economia i organització d'empreses Heuristic algorithms Assembling machines Automation Industrial engineering Workstations genetic algorithms robotic assembly rails industrial control humans robots search methods simulated annealing industrial engineering Treball en cadena Programació heurística Producció -- Planificació Control de processos This paper deals with the assembly line balancing problem considering incompatibilities between the tasks with the aim of: first minimizing the number of workstations, and then minimizing the cycle time for the minimum number of workstations. In order to solve the problem we propose the use of a greedy randomized adaptive search procedure obtained from the application of some classic heuristics based on priority rules, and a genetic algorithm that searches for the solution in the heuristic space. A computational experience is included to illustrate the performance of the proposed approach. Postprint (author's final draft) 2000-04-24 Part of book or chapter of book http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=18287 http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Restricted access - publisher's policy Institute of Electrical and Electronics Engineers (IEEE)