Exploració per tema "Heuristic algorithms"
Ara es mostren els items 1-20 de 89
-
A bounded dynamic programming algorithm for the blocking flow shop problem
(IEEE Computer Society Conference Publishing Services (CPS), 2011-04-11)
Capítol de llibre
Accés restringit per política de l'editorialWe 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
(Institute of Electrical and Electronics Engineers (IEEE), 2011-11-22)
Capítol de llibre
Accés restringit per política de l'editorialIn 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 branch and bound algorithm for the response time variability problem
(Editorial Board, 2012-06-22)
Article
Accés restringit per política de l'editorialThe response time variability problem (RTVP) is an NP-hard scheduling problem that has been studied intensively recently and has a wide range of real-world applications in mixed-model assembly lines, multithreaded computer ... -
A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs
(2016-02-01)
Article
Accés obertThis paper analyzes a realistic variant of the Permutation Flow-Shop Problem (PFSP) by considering a non-smooth objective function that takes into account not only the traditional makespan cost but also failure-risk costs ... -
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
(2018-06)
Article
Accés obertThis paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted ... -
A deep reinforcement learning approach for path following on a quadrotor
(2020)
Text en actes de congrés
Accés obertThis paper proposes the Deep Deterministic Policy Grandient (DDPG) reinforcement learning algorithm to solve the path following problem in a quadrotor vehicle. This agent is implemented using a separated control and guidance ... -
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
Accés obertWe 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 heuristic approach to the design of optimal cross-docking boxes
(Institute of Electrical and Electronics Engineers (IEEE), 2021-09-03)
Article
Accés obertMultinational companies frequently work with manufacturers that receive large orders for different products (or product varieties: size, shape, color, texture, material), to serve thousands of different final destinations ... -
A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions
(Springer, 2017-03)
Article
Accés obertIn 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
Accés obertIn 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 evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
(Institute of Electrical and Electronics Engineers (IEEE), 2017)
Comunicació de congrés
Accés obertThe longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of art-annotated ... -
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
(2017)
Report de recerca
Accés obertThe longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of arc-annotated ... -
A hyper-heuristic to sequencing mixed-models on assembly-lines minimizing work overload
(2007)
Text en actes de congrés
Accés obertThere 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)
Text en actes de congrés
Accés obertThe 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 model and evolutionary algorithms for robust time and space assembly line balancing under uncertain demand
(2016-01)
Article
Accés obertChanges 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)
Report de recerca
Accés obertChanges 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 multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs
(2018-04-01)
Article
Accés obertThis paper deals with a new flexible job-shop scheduling problem in which the objective function to be minimised is the sum of the earliness and tardiness costs of the jobs and the costs of the operations required to perform ... -
A New Constructive Heuristic for the Fm|block|ST
(2014-08-31)
Capítol de llibre
Accés obertThis paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the ... -
A new constructive heuristic for the Fm|block|¿T
(2013)
Text en actes de congrés
Accés obertThis paper deals with the blocking flow shop problem and proposes new constructive procedure s for the total tardiness minimization of jobs. The heuristic has three - phases to build the sequence; the first phase ... -
A Parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics
(2011-01)
Article
Accés obertThis paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical ...