Ponències/Comunicacions de congressos
http://hdl.handle.net/2117/537
2016-12-04T12:35:11ZAplicación de la CLP al problema de secuencias regulares con restricciones en una cadena de montaje de automóviles
http://hdl.handle.net/2117/90257
Aplicación de la CLP al problema de secuencias regulares con restricciones en una cadena de montaje de automóviles
Bautista Valhondo, Joaquín; Companys Pascual, Ramón; Vila, Albert; Pereira Gude, Jordi; Mateo Doll, Manuel
Las líneas de montaje de automóviles presentan problemas de diseño y programación cada vez más complejos generados por la diversificación del producto mediante opciones ofertadas sobre un modelo base. El problema de secuenciación de unidades mixtas en una única línea de producción con el objetivo de atenuar las variaciones de las tasas de consumo de recursos (componentes y cargas de trabajo) ha recibido atención creciente durante los últimos años. En el presente trabajo se presenta una visión de distintos enfoques recogidos en la literatura y se establece una generalización parcial de algunas variantes del problema mediante el CORV ( constrained output rate variation problem ) que parece adaptarse con mayor fidelidad que otros enfoques a la concepción de dichos problemas en la industria de automoción. Se resuelve el problema mediante Propagación Lógica de restricciones (CLP) y se comparan resultados con los ofrecidos por la Programación Dinámica Acotada (BDP)
Líneas de producción, secuencias regulares, Justo a Tiempo
2016-09-28T11:17:31ZBautista Valhondo, JoaquínCompanys Pascual, RamónVila, AlbertPereira Gude, JordiMateo Doll, ManuelLas líneas de montaje de automóviles presentan problemas de diseño y programación cada vez más complejos generados por la diversificación del producto mediante opciones ofertadas sobre un modelo base. El problema de secuenciación de unidades mixtas en una única línea de producción con el objetivo de atenuar las variaciones de las tasas de consumo de recursos (componentes y cargas de trabajo) ha recibido atención creciente durante los últimos años. En el presente trabajo se presenta una visión de distintos enfoques recogidos en la literatura y se establece una generalización parcial de algunas variantes del problema mediante el CORV ( constrained output rate variation problem ) que parece adaptarse con mayor fidelidad que otros enfoques a la concepción de dichos problemas en la industria de automoción. Se resuelve el problema mediante Propagación Lógica de restricciones (CLP) y se comparan resultados con los ofrecidos por la Programación Dinámica Acotada (BDP)Efficient constructive procedures for the distributed blocking flowshop scheduling problem
http://hdl.handle.net/2117/85477
Efficient constructive procedures for the distributed blocking flowshop scheduling problem
Companys Pascual, Ramón; Ribas Vila, Immaculada
the distributed blocking flow shop scheduling problem (DBFSP) allows modeling of the scheduling process in companies with more than one factory, with productive systems configured as flow shop lines where the blocking constraint has to be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this paper, we propose some constructive heuristics that will solve the DBFSP and thus minimize the maximum completion time among the factories. The proposed procedures use two approaches that are totally different from those proposed for the distributed permutation flow shop scheduling problem (DPFSP). By taking the DPFSP procedures that we adapted to DBFSP and comparing them to the new approaches that were specifically designed for DBPFSP, we find that the latter perform considerably better.
2016-04-11T11:47:25ZCompanys Pascual, RamónRibas Vila, Immaculadathe distributed blocking flow shop scheduling problem (DBFSP) allows modeling of the scheduling process in companies with more than one factory, with productive systems configured as flow shop lines where the blocking constraint has to be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this paper, we propose some constructive heuristics that will solve the DBFSP and thus minimize the maximum completion time among the factories. The proposed procedures use two approaches that are totally different from those proposed for the distributed permutation flow shop scheduling problem (DPFSP). By taking the DPFSP procedures that we adapted to DBFSP and comparing them to the new approaches that were specifically designed for DBPFSP, we find that the latter perform considerably better.Lyon- Madrid freight transport corridor greenness: indicators and actions
http://hdl.handle.net/2117/82056
Lyon- Madrid freight transport corridor greenness: indicators and actions
Benedito Benet, Ernest; Corominas Subias, Albert; Olivella Nadal, Jordi; Pastor Moreno, Rafael
2016-01-26T12:50:05ZBenedito Benet, ErnestCorominas Subias, AlbertOlivella Nadal, JordiPastor Moreno, RafaelA procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product
http://hdl.handle.net/2117/80004
A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product
Mateo Doll, Manuel; Manier, Marie-Ange; Companys Pascual, Ramón
When various kinds of products must receive the sam
e treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing
composed of a job from each batch can be scheduled. A hoist ensures the auto-mated transfer of the jobs between tanks. The problem consists in the scheduling of repetitive hoist movements, which is known as CHSP (Cyclic Hoist Scheduling
Problem). The objective is to find a sequence which minimizes the cycle time for jobs from different products. We consider the probl
em wheren types of products must be treated and we search an n-cyclic schedule. The algorithm is based on the
resolution of different sequences of products. For each one, a branch-and-bound is solved which considers only coherent subsequences.
It enables to reduce the com-putational times most of the time for instances with 5 tanks and 4 product types
2015-11-27T12:01:39ZMateo Doll, ManuelManier, Marie-AngeCompanys Pascual, RamónWhen various kinds of products must receive the sam
e treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing
composed of a job from each batch can be scheduled. A hoist ensures the auto-mated transfer of the jobs between tanks. The problem consists in the scheduling of repetitive hoist movements, which is known as CHSP (Cyclic Hoist Scheduling
Problem). The objective is to find a sequence which minimizes the cycle time for jobs from different products. We consider the probl
em wheren types of products must be treated and we search an n-cyclic schedule. The algorithm is based on the
resolution of different sequences of products. For each one, a branch-and-bound is solved which considers only coherent subsequences.
It enables to reduce the com-putational times most of the time for instances with 5 tanks and 4 product typesA procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem
http://hdl.handle.net/2117/79118
A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem
Mateo Doll, Manuel; Manier, Marie-Ange; Companys Pascual, Ramón
When various kinds of products must receive the same treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can be scheduled. A hoist ensures the auto-
mated transfer of the jobs between tanks. The probl
em consists in the scheduling of repetitive hoist movements, which is known as CHSP (Cyclic Hoist Scheduling Problem). The objective is to find a sequence which minimizes the cycle time for
jobs from different products. We consider the problem where types of products must be treated and we search an n-cyclic schedule.
The algorithm is based on the resolution of different sequences of products. For each one, a branch-and-bound is solved which considers only coherent subsequences. It enables to reduce the com-
putational times most of the time for instances with 5 tanks and 4 product types
2015-11-12T12:35:13ZMateo Doll, ManuelManier, Marie-AngeCompanys Pascual, RamónWhen various kinds of products must receive the same treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can be scheduled. A hoist ensures the auto-
mated transfer of the jobs between tanks. The probl
em consists in the scheduling of repetitive hoist movements, which is known as CHSP (Cyclic Hoist Scheduling Problem). The objective is to find a sequence which minimizes the cycle time for
jobs from different products. We consider the problem where types of products must be treated and we search an n-cyclic schedule.
The algorithm is based on the resolution of different sequences of products. For each one, a branch-and-bound is solved which considers only coherent subsequences. It enables to reduce the com-
putational times most of the time for instances with 5 tanks and 4 product typesOptimization of the logistics of extra-curricular activities
http://hdl.handle.net/2117/79116
Optimization of the logistics of extra-curricular activities
Mateo Doll, Manuel; Aghezzaf, El Houssaine
Most of the children develop extra-curricular activities in the afternoon after the school timetable. These activities are generally organized in each school, but sometimes the amount de scholars interested in one activity is very limited; the school has a few available resources or the preferences of their students do not match with the facilities. To expand the number of activities offered to the students in a school the creation of clusters that group different schools is proposed. But also a transport problem appears as the children should be moved from one school to another, where they can enjoy their preferred activities. Th
erefore, this can be considered a School Bus Routing Problem (SBRP). We define a procedure of several steps. First, a heuristic is implemented to obtain the clusters. Subsequently, the assignment of activities and the optimal path between cluster's members are determined. The proposed children transport is based on the availability of one or two buses per cluster. This model has been applied to the schools in Barcelona
2015-11-12T12:18:46ZMateo Doll, ManuelAghezzaf, El HoussaineMost of the children develop extra-curricular activities in the afternoon after the school timetable. These activities are generally organized in each school, but sometimes the amount de scholars interested in one activity is very limited; the school has a few available resources or the preferences of their students do not match with the facilities. To expand the number of activities offered to the students in a school the creation of clusters that group different schools is proposed. But also a transport problem appears as the children should be moved from one school to another, where they can enjoy their preferred activities. Th
erefore, this can be considered a School Bus Routing Problem (SBRP). We define a procedure of several steps. First, a heuristic is implemented to obtain the clusters. Subsequently, the assignment of activities and the optimal path between cluster's members are determined. The proposed children transport is based on the availability of one or two buses per cluster. This model has been applied to the schools in BarcelonaErgonomics as basis for a decision support system in the printing industry
http://hdl.handle.net/2117/26672
Ergonomics as basis for a decision support system in the printing industry
Mateo Doll, Manuel; Álvarez Casado, Enrique; Rodríguez Mondelo, Pedro Manuel; Tarral, Marc
2015-03-12T11:03:56ZMateo Doll, ManuelÁlvarez Casado, EnriqueRodríguez Mondelo, Pedro ManuelTarral, MarcEl Alumbre: design, implementation and management of a community small-scale wind generation project
http://hdl.handle.net/2117/25910
El Alumbre: design, implementation and management of a community small-scale wind generation project
Chiroque, Jose; Escobar, Rafael; Ferrer Martí, Laia; Garwood, Anna
2015-01-19T14:02:47ZChiroque, JoseEscobar, RafaelFerrer Martí, LaiaGarwood, AnnaMethodology for designing stand-alone wind-PV community electrification projects considering technical and social constraints
http://hdl.handle.net/2117/23135
Methodology for designing stand-alone wind-PV community electrification projects considering technical and social constraints
Domenech Léga, Bruno; Ranaboldo, Matteo; Ferrer Martí, Laia; Pastor Moreno, Rafael
This paper presents a methodology to design stand-alone electrification systems based on wind and photovoltaic technologies, which combines individual systems and microgrids, and considers technical and social requirements of the community and its population. The methodology starts with some assessments to identify the community to electrify and guides through the whole decision-making until the most appropriate solution is chosen. The design is organized in three decision levels, ordered according to the importance of the decisions taken: the cost is faced to the demand (level 1), to the
management of the system (level 2), and to the security of supply (level 3). Each level is divided in two steps: first a set of electrification alternatives is generated and then the most appropriate is selected,
based on economical, technical and social criteria. Moreover, two iterative procedures allow adjusting the decisions taken when going in-depth into the problem. Finally the methodology is validated by two
experts that have designed the electrification system of two real communities. It is concluded that the methodology is suitable to assist rural electrification promoters in developing countries, allowing the
study of many design options, and obtaining solutions that match up end users’ preferences and include social benefits that strongly compensate the slight cost increases.
2014-06-03T11:02:23ZDomenech Léga, BrunoRanaboldo, MatteoFerrer Martí, LaiaPastor Moreno, RafaelThis paper presents a methodology to design stand-alone electrification systems based on wind and photovoltaic technologies, which combines individual systems and microgrids, and considers technical and social requirements of the community and its population. The methodology starts with some assessments to identify the community to electrify and guides through the whole decision-making until the most appropriate solution is chosen. The design is organized in three decision levels, ordered according to the importance of the decisions taken: the cost is faced to the demand (level 1), to the
management of the system (level 2), and to the security of supply (level 3). Each level is divided in two steps: first a set of electrification alternatives is generated and then the most appropriate is selected,
based on economical, technical and social criteria. Moreover, two iterative procedures allow adjusting the decisions taken when going in-depth into the problem. Finally the methodology is validated by two
experts that have designed the electrification system of two real communities. It is concluded that the methodology is suitable to assist rural electrification promoters in developing countries, allowing the
study of many design options, and obtaining solutions that match up end users’ preferences and include social benefits that strongly compensate the slight cost increases.An efficient metaheuristic for the inventory orienteering problem and the single-vehicle cyclic inventory routing problem
http://hdl.handle.net/2117/21688
An efficient metaheuristic for the inventory orienteering problem and the single-vehicle cyclic inventory routing problem
Vansteenwegen, Pieter; Mateo Doll, Manuel
2014-02-21T10:52:59ZVansteenwegen, PieterMateo Doll, Manuel