Universitat Politècnica de Catalunya
Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses
Universitat Politècnica de Catalunya. OPE - Organització de la Producció i d'Empresa (aspectes tècnics, jurídics i econòmics en Producció)
2011-04-11
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
Postprint (published version)
Part of book or chapter of book
English
Àrees temàtiques de la UPC::Economia i organització d'empreses; Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems; involving the joint optimization of conflicting criteria such as the cycle time; the number of stations; 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; given a fixed cycle time limit. The good behaviour of the proposal is shown in nine problem instances; Programació heurística
IEEE Computer Society Conference Publishing Services (CPS)
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5937060
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Restricted access - publisher's policy
E-prints [72986]
