<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-17T02:58:07Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/90833" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/90833</identifier><datestamp>2025-07-17T03:34:00Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing problem</dc:title>
   <dc:creator>Chica Serrano, Manuel</dc:creator>
   <dc:creator>Cordón García, Oscar</dc:creator>
   <dc:creator>Bautista Valhondo, Joaquín</dc:creator>
   <dc:creator>Damas Arroyo, Sergio</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. OPE - Organització de la Producció i d'Empresa (aspectes tècnics, jurídics i econòmics en Producció)</dc:contributor>
   <dc:subject>Àrees temàtiques de la UPC::Economia i organització d'empreses</dc:subject>
   <dc:subject>Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems</dc:subject>
   <dc:subject>involving the joint optimization of conflicting criteria such as the cycle time</dc:subject>
   <dc:subject>the number of stations</dc:subject>
   <dc:subject>and/or the area of these stations. The aim of this contribution is to present a new multiobjective memetic algorithm based on ant colony optimization for the 1/3 variant of this family of industrial problems. This variant involves the joint minimisation of the number and the area of the stations</dc:subject>
   <dc:subject>given a fixed cycle time limit. The good behaviour of the proposal is shown in nine problem instances</dc:subject>
   <dc:subject>Programació heurística</dc:subject>
   <dc:description>We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known solutions for four of the Taillard’s instances</dc:description>
   <dc:description>Postprint (published version)</dc:description>
   <dc:date>2011-04-11</dc:date>
   <dc:type>Part of book or chapter of book</dc:type>
   <dc:identifier>Chica, M., Cordón, O., Bautista, J., Damas, S. A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing problem. A: "2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS 2011) Proceedings". Los Alamitos (California): IEEE Computer Society Conference Publishing Services (CPS), 2011, p. 16-22.</dc:identifier>
   <dc:identifier>978-1-61284-332-2</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/90833</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5937060</dc:relation>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
   <dc:rights>Restricted access - publisher's policy</dc:rights>
   <dc:format>7 p.</dc:format>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>IEEE Computer Society Conference Publishing Services (CPS)</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>