Browsing by Author "Bautista Valhondo, Joaquín"
Now showing items 1-20 of 330
-
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 case study at the Nissan Barcelona factory to minimize the ergonomic risk and its standard deviation in a mixed-model assembly line
(Springer, 2017-06-05)
Article
Open AccessThis work examines a balancing problem wherein the objective is to minimize both the ergonomic risk dispersion between the set of workstations of a mixed-model assembly line and the risk level of the workstation with the ... -
A conceptual model to manage supply sequences in automotive industry for Nissan Barcelona
(2015)
Conference report
Open AccessThis paper presents an action research experience in Douki-Seisan in cooperation with the Nissan Factory in Barcelona. Three suppliers are involved in the experience to improve the way they perform synchro deliveries of ... -
A dynamic programming based heuristic for the assembly line balancing problem
(Elsevier, 2009-05-01)
Article
Restricted access - publisher's policyThe simple assembly line balancing problem is the simplification of a real problem associated to the assignment of the elementary tasks required for assembly of a product in an assembly line. This problem has been extensively ... -
A GRASP algorithm for quota sequences with minimum work overload and forced interruption of operations in a mixed-product assembly line
(Springer, 2018-03-13)
Article
Open AccessWe present a GRASP algorithm to solve a problem that involves the sequencing of mixed products in an assembly line. The objective of the problem is to obtain a manufacturing sequence of models that generates a minimum work ... -
A GRASP algorithm to optimize operational costs and regularity of production in mixed-model sequencing problems with forced interruption of operations
(Springer, 2018-10-23)
Part of book or chapter of book
Restricted access - publisher's policyThis book constitutes the refereed proceedings of the 18th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2018, held in Granada, Spain, in October 2018. The 36 full papers presented were carefully ... -
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 ... -
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 hyper-heuristic to sequencing mixed-models on assembly-lines minimizing work overload
(2007)
Conference report
Open AccessThere are different approaches for the mixed-model assembly-lines sequencing problem. In this paper the goal of minimizing work overload is treated. This approach considers the existence of time windows in each work ... -
A multiobjective genetic algorithm and robustness information function for time and space assembly line balancing
(2013)
Conference report
Open AccessThe time and space assembly line balancing problem (TSALBP) is a realistic multiobjective version of assembly line balancing industrial problems involving the joint optimization of conflicting criteria such as the cycle ... -
A multiobjective GRASP for the 1/3 variant of the time and space assembly line balancing problem
(Springer Verlag, 2010-06-01)
Part of book or chapter of book
Restricted access - publisher's policyTime and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems, involving the joint optimisation of conflicting criteria such as the cycle ... -
A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing 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 multiobjective model and evolutionary algorithms for robust time and space assembly line balancing under uncertain demand
(2016-01)
Article
Open AccessChanges in demand when manufacturing different products require an optimization model that includes robustness in its definition and methods to deal with it. In this work we propose the r-TSALBP, a multiobjective model for ... -
A multiobjective model and evolutionary algorithms for robust time and space assembly line balancing under uncertain demand
(2015-04-20)
Research report
Open AccessChanges in demand when manufacturing different products require an optimization model that includes robustness in its definition and methods to deal with it. In this work we propose the r-TSALBP, a multiobjective model for ... -
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 -
A refined GRASP algorithm for the extended car sequencing problem
(2015)
Conference report
Open AccessIn this study, we investigate the performance of GRASP (Greedy Randomized Adaptive Search Procedure) mataheuristic that has been used for solving extended optimization version of CSP (Car Sequencing Problem) with respect ... -
A robustness information and visualization model for time and space assembly line balancing under uncertain demand
(2013-10-01)
Article
Restricted access - publisher's policyThe time and space assembly line balancing problem (TSALBP) is a realistic multiobjective version of assembly line balancing industrial problems involving the joint optimization of conflicting criteria such as the cycle ...
