Browsing by Author "Cano Pérez, Alberto"
Now showing items 1-20 of 22
-
A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem
(2011)
Conference report
Restricted access - publisher's policyWe present some results attained with two variants of 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 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 bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations
(2011)
Conference report
Restricted access - publisher's policyIn this paper, we propose a procedure based on Bounded Dynamic Programming (BDP) to solve the Mixed- Model Sequencing Problem with Workload Minimisation (MMSP-W), with serial workstations and unrestricted (or ... -
A bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations
(Institute of Electrical and Electronics Engineers (IEEE), 2011-11-22)
Part of book or chapter of book
Restricted access - publisher's policyIn this paper, we propose a procedure based on Bounded Dynamic Programming ( BDP ) to solve the Mixed- Model Sequencing Problem with Workload Minimisation ( MMSP-W ), with serial workstations and unrestricted (or free) ... -
A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions
(Springer, 2017-03)
Article
Open AccessIn this article, we propose a hybrid procedure based on bounded dynamic programming assisted by linear programming to solve the mixed-model sequencing problem with workload minimization with serial workstations, free ... -
A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions
(Springer Berlin Heidelberg, 2016-08-30)
Article
Open AccessIn this article, we propose a hybrid procedure based on bounded dynamic programming assisted by linear programming to solve the mixed-model sequencing problem with workload minimization with serial workstations, free ... -
Algoritmos GRASP para solucionar el problema Blocking Flow Shop
(2013)
Conference report
Open AccessSe resuelve el Blocking Flow Shop Problem (BFSP), consis- te en determinar una secuencia de piezas procesadas por una l nea de m aquinas sin espacios de almacenamiento entre ellas. Para ello, se im- plementan 14 ... -
Una aplicación de la programación dinámica acotada para un problema de taller mecánico con flujo regular y bloqueo de operaciones (Fm/block/Cmax)
(Universitat Politècnica de Catalunya, 2011-04-28)
Master thesis (pre-Bologna period)
Open AccessEl problema objeto de estudio es la programación de piezas en un sistema Flow Shop permutado con bloqueos. Este problema se ubica en el ámbito de los problemas asociados a Taller Mecánico. El objetivo de este proyecto es ... -
Extended models for TSALBP with ergonomic risk Constraints
(International Federation of Automatic Control (IFAC), 2013-06-21)
Article
Open AccessIn this paper, we present an extension to the TSALB problem (Time and Space constrained Assembly Line Balancing) with ergonomic risk restrictions. This ergonomic risk is defined from the task durations and their categories ... -
Extended models for TSALBP with ergonomic risk constraints
(2013)
Conference report
Open AccessIn this paper, we present an extension to the TSALB problem (Time and Space constrained Assembly Line Balancing) with ergonomic risk restrictions. This ergonomic risk is defi ned from the task durations and their categories ... -
Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W
(International Federation of Automatic Control (IFAC), 2013-06-21)
Article
Open AccessIn this paper, we propose a hybrid procedure based on Bounded Dynamic Programming (BDP) and linear programming to solve the Mixed-Model Sequencing Problem with Workload Minimization (MMSP-W), with serial workstations, free ... -
Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W
(2013)
Conference lecture
Open Accessn this paper, we propose a hybrid procedure based on Bounded Dynamic Programming ( BDP ) and linear programming to solve the Mixed - Model Se quencing Problem with Workload Minimization ( MMSP - W ), with serial ... -
Incorporando regularidad del trabajo requerido al MMSP con mínima sobrecarga.
(2012)
Conference report
Open AccessSe presenta un modelo matemático para una variante del problema Mixed - Model Sequencing ( MMSP ) minimizando la sobrecarga y manteniendo constante la tasa del trabajo requerido. Se realiza un exper i mento con ... -
Incorporating regularity of required workload to the MMSP-W with serial workstations and free interrumption of the operations
(2012)
Conference lecture
Open Access -
Ingeniería de organización : Prácticas finales
(Universitat Politècnica de Catalunya, 2012)
Lecture notes
Open Access -
Modelado y resolución de problemas de secuenciación en contexto JIT/DS mediante BDP
(Universitat Politècnica de Catalunya, 2014-06-20)
Doctoral thesis
Open AccessThis document develops the doctoral thesis entitled "Modelado y resolución de problemas de secuenciación en contexto JIT/DS mediante BDP". Through a literature review we explain the problems, within the environment of the ... -
Modeling and solving a variant of MMSP-W problem with production mix restrictions.
(2012)
Conference report
Open AccessIn this paper, we propose a procedure based on Bounded Dynamic Pr o- gramming ( BDP ) to solve the Mixed - Model Sequencing Problem with Work ove r- load Minimisation ( MMSP - W ), with serial workstations, ... -
Modeling and solving a variant of the mixed-model sequencing problem with work overload minimisation and regularity constraints. An application in Nissan’s Barcelona Plant
(2012-09-15)
Article
Restricted access - publisher's policyIn this paper, we present an extension to the mixed-model sequencing problem with work overload minimisation (MMSP-W) for production lines with serial workstations and parallel homogeneous processors. The extension is ... -
Solving a Mixed-Model Sequencing Problem with production mix restriction by Bounded Dynamic Programming
(2015-11-24)
Research report
Open AccessIn this article, we propose a hybrid procedure based on bounded dynamic programming (BDP) assisted by linear programming to solve the mixed-model sequencing problem with workload minimization (MMSP-W) with serial workstations, ... -
Solving the Fm|block|Cmax problem using bounded dynamic programming
(2011-11)
Article
Open AccessWe present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm|block|Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known ...
