Capítols de llibre
http://hdl.handle.net/2117/7219
20170426T12:06:38Z

Local search heuristics for the assembly line balancing problem with incompatibilities between tasks
http://hdl.handle.net/2117/91316
Local search heuristics for the assembly line balancing problem with incompatibilities between tasks
Bautista Valhondo, Joaquín; Suárez Feijóo, Raúl; Mateo Doll, Manuel; Companys Pascual, Ramón
This 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 number of workstations. In order to solve the problem we propose the use of a greedy randomized adaptive search procedure obtained from the application of some classic heuristics based on priority rules, and a genetic algorithm that searches for the solution in the heuristic space. A computational experience is included to illustrate the performance of the proposed approach.
20161102T09:35:29Z
Bautista Valhondo, Joaquín
Suárez Feijóo, Raúl
Mateo Doll, Manuel
Companys Pascual, Ramón
This 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 number of workstations. In order to solve the problem we propose the use of a greedy randomized adaptive search procedure obtained from the application of some classic heuristics based on priority rules, and a genetic algorithm that searches for the solution in the heuristic space. A computational experience is included to illustrate the performance of the proposed approach.

Application of genetic algorithms to assembly sequence planning with limited resources
http://hdl.handle.net/2117/90834
Application of genetic algorithms to assembly sequence planning with limited resources
Bautista Valhondo, Joaquín; Lusa García, Amaia; Suárez Feijóo, Raúl; Mateo Doll, Manuel; Pastor Moreno, Rafael; Corominas Subias, Albert
Heuristic procedures based on priority rules are quite frequently used to solve the multiple resourceconstrained projectscheduling problem (RCPSP), i.e. task programming with limited resources. The rules are based on the problem knowledge. Different local search procedures have been proposed in order to look for acceptable solutions in scheduling problems. In this work, local search procedures, that define the solution neighborhood based on greedy heuristics, are proposed to assign assembly operations to a fixed number of robots in a manufacturing cell. A genetic algorithm is used to generate the solution
20161018T10:16:25Z
Bautista Valhondo, Joaquín
Lusa García, Amaia
Suárez Feijóo, Raúl
Mateo Doll, Manuel
Pastor Moreno, Rafael
Corominas Subias, Albert
Heuristic procedures based on priority rules are quite frequently used to solve the multiple resourceconstrained projectscheduling problem (RCPSP), i.e. task programming with limited resources. The rules are based on the problem knowledge. Different local search procedures have been proposed in order to look for acceptable solutions in scheduling problems. In this work, local search procedures, that define the solution neighborhood based on greedy heuristics, are proposed to assign assembly operations to a fixed number of robots in a manufacturing cell. A genetic algorithm is used to generate the solution

MixedModel Sequencing Problem with overload minimization considering workstations dependencies
http://hdl.handle.net/2117/89575
MixedModel Sequencing Problem with overload minimization considering workstations dependencies
Bautista Valhondo, Joaquín; Suárez Feijóo, Raúl
Proceedings of T2B.3 2009 IEEE International Symposium on Assembly and Manufacturing 1720 November 2009, Suwon, Korea 9781424446285/09/$25.00 ©2009 IEEE Mixedmodel sequencing problem with overload minimization considering workstations dependencies Joaqu ́ ın Bautista and Ra ́ ul Su ́ arez Abstract — This paper reviews the formulation of the Mixed Model Sequencing Problem with Workload minimization (MMSPW). Two significative models already presented in the literature are describe, showing that they are valid for the case of parallel workstations, but do not properly solve the case of serial workstations. After that, a new model is introduced that is valid for the case of serial workstations. An example is used to illustrate the performance of all the models, and a computational experience was done to verify the applicability of the proposed model using the solver CPLEX and a set of problem instances of small dimension adapted from the literature.
20160905T11:48:07Z
Bautista Valhondo, Joaquín
Suárez Feijóo, Raúl
Proceedings of T2B.3 2009 IEEE International Symposium on Assembly and Manufacturing 1720 November 2009, Suwon, Korea 9781424446285/09/$25.00 ©2009 IEEE Mixedmodel sequencing problem with overload minimization considering workstations dependencies Joaqu ́ ın Bautista and Ra ́ ul Su ́ arez Abstract — This paper reviews the formulation of the Mixed Model Sequencing Problem with Workload minimization (MMSPW). Two significative models already presented in the literature are describe, showing that they are valid for the case of parallel workstations, but do not properly solve the case of serial workstations. After that, a new model is introduced that is valid for the case of serial workstations. An example is used to illustrate the performance of all the models, and a computational experience was done to verify the applicability of the proposed model using the solver CPLEX and a set of problem instances of small dimension adapted from the literature.

Simultaneous Interconnection and Damping Assignment PassivityBased Control: Two Practical Examples
http://hdl.handle.net/2117/6084
Simultaneous Interconnection and Damping Assignment PassivityBased Control: Two Practical Examples
Batlle Arnau, Carles; Dòria Cerezo, Arnau; Espinosa Pérez, Gerardo; Ortega, Romeo
Passivitybased control (PBC) is a generic name given to a family of controller design techniques that achieves system stabilization via the route of passivation, that is, rendering the closedloop system passive with a desired storage function (that usually qualifies as a Lyapunov function for the stability analysis.) If the passivity property turns out to be output strict, with an output signal with respect to which the system is detectable, then asymptotic stability is ensured.
20091214T09:03:05Z
Batlle Arnau, Carles
Dòria Cerezo, Arnau
Espinosa Pérez, Gerardo
Ortega, Romeo
Passivitybased control (PBC) is a generic name given to a family of controller design techniques that achieves system stabilization via the route of passivation, that is, rendering the closedloop system passive with a desired storage function (that usually qualifies as a Lyapunov function for the stability analysis.) If the passivity property turns out to be output strict, with an output signal with respect to which the system is detectable, then asymptotic stability is ensured.

SemiDynamic Demand in a NonPermutation Flowshop with Constrained Resequencing Buffers.
http://hdl.handle.net/2117/6072
SemiDynamic Demand in a NonPermutation Flowshop with Constrained Resequencing Buffers.
Färber, Gerrit Hartmut; Salhi, Said; Coves Moreno, Anna Maria
This work presents the performance comparison of two conceptually different approaches for a mixed model nonpermutation flowshop production line. The demand is a semidynamic 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.
20091130T11:10:44Z
Färber, Gerrit Hartmut
Salhi, Said
Coves Moreno, Anna Maria
This work presents the performance comparison of two conceptually different approaches for a mixed model nonpermutation flowshop production line. The demand is a semidynamic 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.