Capítols de llibre
Recent Submissions
-
A critical sight to the NEH heuristic
(Springer, 2017-04-03)
Part of book or chapter of book
Restricted access - publisher's policy -
Heurísticas de búsqueda local aplicadas al problema de equilibrado de líneas de montaje con incompatibilidades entre tareas
(Centre de Publicacions d'Abast (CPDA - ETSEIB), 1999-09-16)
Part of book or chapter of book
Open AccessSe propone una generalización de los algoritmos GRASP (Greedy Randomized Adaptative Search Procedure). Se realiza una aplicación al problema de secuenciación de productos mixtos en una línea de montaje para regularizar el ... -
GRWASP: una generalización de los algoritmos GRASP. Aplicación al ORVP
(Centre de Publicacions d'Abast (CPDA - ETSEIB), 1999-09-16)
Part of book or chapter of book
Open AccessSe propone una generalización de los algoritmos GRASP (Greedy Randomized Adaptative Search Procedure). Se realiza una aplicación al problema de secuenciación de productos mixtos en una línea de montaje para regularizar el ... -
Una visión sobre el problema de programación de transportadores
(Centre de Publicacions d'Abast (CPDA - ETSEIB), 1999-09-16)
Part of book or chapter of book
Open Access -
Aportaciones a la modelización y resolución del problema de reparto proporcional con aplicaciones a la organización
(Centre de Publicacions d'Abast (CPDA - ETSEIB), 1999-09-16)
Part of book or chapter of book
Open AccessEl problema del reparto proporcional ha sido estudiado principalmente en relación con el reparto de escaños en una cámara de representantes, pero tiene muchas otras aplicaciones, una de las cuales es la resolución del ... -
Local search heuristics for the assembly line balancing problem with incompatibilities between tasks
(Institute of Electrical and Electronics Engineers (IEEE), 2000-04-24)
Part of book or chapter of book
Restricted access - publisher's policyThis 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 ... -
Application of genetic algorithms to assembly sequence planning with limited resources
(IEEE Computer Society Conference Publishing Services (CPS), 1999-07-24)
Part of book or chapter of book
Restricted access - publisher's policyHeuristic procedures based on priority rules are quite frequently used to solve the multiple resource-constrained project-scheduling problem (RCPSP), i.e. task programming with limited resources. The rules are based on the ... -
A bounded dynamic programming algorithm for the blocking flow shop problem
(IEEE Computer Society Conference Publishing Services (CPS), 2011-04-11)
Part of book or chapter of book
Restricted access - publisher's policyWe 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 ... -
A procedure to solve the CORV problem
(IEEE Computer Society Conference Publishing Services (CPS), 1999-07-24)
Part of book or chapter of book
Restricted access - publisher's policy -
KPI’s for a green corridor
(2015-12-15)
Part of book or chapter of book
Open Access -
Supplier evaluation and selection: a review of the literature since 2007
(Springer Cham Heidelberg New York Dordrecht London, 2014-08-31)
Part of book or chapter of book
Open AccessSupplier selection is currently a subject of great importance to companies. Numerous articles have been published recently, recommending different methods and/or procedures for evaluating and selecting the suppliers with ... -
A New Constructive Heuristic for the Fm|block|ST
(2014-08-31)
Part of book or chapter of book
Open AccessThis paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the ...
RSS 1.0