Y
Y. Cardona-Valdés
Researcher at Autonomous University of Coahuila
Publications - 8
Citations - 217
Y. Cardona-Valdés is an academic researcher from Autonomous University of Coahuila. The author has contributed to research in topics: Supply chain & Metaheuristic. The author has an hindex of 5, co-authored 5 publications receiving 177 citations. Previous affiliations of Y. Cardona-Valdés include Monterrey Institute of Technology and Higher Education & Universidad Autónoma de Nuevo León.
Papers
More filters
Journal ArticleDOI
A bi-objective supply chain design problem with uncertainty
TL;DR: The authors develop a stochastic optimization model under demand uncertainty, where the inherent risk is modeled by scenarios, and propose solution methods for the stochastically optimization problem based on L-shaped algorithm within an e-optimality framework.
Journal ArticleDOI
Metaheuristic procedure for a bi-objective supply chain design problem with uncertainty
TL;DR: In this paper, a two echelon production distribution network with multiple manufacturing plants, distribution centers and a set of candidate warehouses is considered, and a two-stage stochastic problem is formulated in order to minimize total cost and total service time, simultaneously.
Journal ArticleDOI
Including preventive maintenance activities in an unrelated parallel machine environment with dependent setup times
TL;DR: This paper presents a mathematical formulation for a new scheduling problem on unrelated parallel machines that considers, in conjunction, preventive maintenance activities and setup times depending on the sequence and the machine and designs an efficient metaheuristic algorithm based on a multi-start strategy for solving larger instances.
Journal ArticleDOI
Mixed integer formulations for the multiple minimum latency problem
TL;DR: An extensive computational experimentation shows that the time-dependent formulations show a much better performance than the other formulations, regarding to the size of instances that can be solved and the elapsed computational time to reach the optimal solutions.
Journal ArticleDOI
Minimizing customers' waiting time in a vehicle routing problem with unit demands
TL;DR: A new variant of the unit demand vehicle routing problem with the aim of minimizing the sum of customers waiting times to receive service, and implements two variants of the metaheuristic algorithm using two different strategies in the constructive phase.