http://hdl.handle.net/2117/5196 Thu, 23 May 2013 11:21:09 GMT 2013-05-23T11:21:09Z webmaster.bupc@upc.edu Universitat Politècnica de Catalunya. Servei de Biblioteques i Documentació no http://hdl.handle.net/2117/19026 Title: Diseño de un plan estratégico docente para la formación de estudiantes universitarios hacia la creación y dirección de empresas familiares Barcelona, España Authors: Garcia, Linda; Fuentes, Dario; Pico, Beatriz; Mas Machuca, Marta; Subirachs, Miquell Mon, 29 Apr 2013 07:59:22 GMT http://hdl.handle.net/2117/19026 2013-04-29T07:59:22Z Garcia, Linda; Fuentes, Dario; Pico, Beatriz; Mas Machuca, Marta; Subirachs, Miquell no http://hdl.handle.net/2117/15100 Title: Experiences of Community Wind Electrification Projects in Bolivia: Evaluation and Improvements for Future Projects Authors: Ferrer Martí, Laia; Doménech, Bruno; Canedo, Walter; Reza, Carlos; Tellez, Mirtha; Dominguez, Milton; Perone, Lorenzo; Salinas, Jaime Mon, 13 Feb 2012 14:06:08 GMT http://hdl.handle.net/2117/15100 2012-02-13T14:06:08Z Ferrer Martí, Laia; Doménech, Bruno; Canedo, Walter; Reza, Carlos; Tellez, Mirtha; Dominguez, Milton; Perone, Lorenzo; Salinas, Jaime no http://hdl.handle.net/2117/11502 Title: Improvement tools for NEH based heuristics on permutation and blocking flow shop scheduling problems Authors: Companys Pascual, Ramón; Ribas Vila, Immaculada; Mateo Doll, Manuel Abstract: In this paper, two tools to improve the performance of the NEH-based heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of the problems considered and the second one is a new tie-breaking strategy to be use in the insertion phase of the NEH heuristic. In addition, we have analyzed the behavior of five initial solution procedures for both problems. The test done confirms the effectiveness of the measures proposed and allows us to recommend the best ordering procedure for each problem. Wed, 23 Feb 2011 11:48:05 GMT http://hdl.handle.net/2117/11502 2011-02-23T11:48:05Z Companys Pascual, Ramón; Ribas Vila, Immaculada; Mateo Doll, Manuel no In this paper, two tools to improve the performance of the NEH-based heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of the problems considered and the second one is a new tie-breaking strategy to be use in the insertion phase of the NEH heuristic. In addition, we have analyzed the behavior of five initial solution procedures for both problems. The test done confirms the effectiveness of the measures proposed and allows us to recommend the best ordering procedure for each problem. http://hdl.handle.net/2117/6072 Title: Semi-Dynamic Demand in a Non-Permutation Flowshop with Constrained Resequencing Buffers. Authors: Färber, Gerrit Hartmut; Salhi, Said; Coves Moreno, Anna Maria Abstract: This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. An exact approach, using Constraint Logic Programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied. Mon, 30 Nov 2009 11:10:44 GMT http://hdl.handle.net/2117/6072 2009-11-30T11:10:44Z Färber, Gerrit Hartmut; Salhi, Said; Coves Moreno, Anna Maria no Semi-dynamic demand, Constraint Logic Programming, Genetic Algorithm, Non-Permutation Flowshop, Mixed model assembly line, Demanda semi-dinámica, Programación lógica con restricciones, Programació lògica amb restriccions, Algoritmo genético, Algoritme genètic, Línea de montaje de modelo mixto, Línia de muntatge de model mixt This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. An exact approach, using Constraint Logic Programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied.