Elkin Rodríguez-Velásquez

Dr. Elkin Rodríguez-Velásquez

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 September 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
ECEmiro Antonio Campo
Emiro Antonio Campo
Jose Alejandro CanoJose Alejandro Cano
Jose Alejandro Cano
Rodrigo GómezRodrigo Gómez
Rodrigo Gómez
ERElkin Rodríguez-Velásquez
Elkin Rodríguez-Velásquez
Pablo CortésPablo Cortés
Pablo Cortés
The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve the production of multiple products with different processing routes and products with short life cycles, which prevents obtaining deterministic setup and processing times. Likewise, several industries present restrictions when changing from one reference to another in the production system, incurring variable and sequence-dependent setup times. Therefore, this article aims to solve the flexible job shop scheduling problem (FJSSP) considering due windows, sequence-dependent setup times, and uncertainty in processing and setup times. A genetic algorithm is proposed to solve the FJSSP by integrating fuzzy logic to minimize the weighted penalties for tardiness/earliness. The proposed algorithm is implemented in a real-world case study of a fabric finishing production system, and it is compared with four heuristics adapted to the FJSSP such as earliest due date, critical reason, shortest processing time, and Monte Carlo simulation. Results show that the performance of the proposed algorithm provides efficient and satisfactory solutions concerning the objective function and computing time since it overperforms (more than 30%) the heuristics used as benchmarks.

1 February 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
JVJohn Valencia
John Valencia
ERElkin Rodríguez-Velásquez
Elkin Rodríguez-Velásquez
The Blocking Job Shop Scheduling Problem (BJSSP) is a variant of the classical Job Shop Scheduling Problem in which a job completed on one machine cannot be transferred to the next machine until the latter becomes available, causing the current machine to remain blocked. Numerous real-world applications have been modeled as the BJSSP, which is classified as a strongly NP-hard problem. Previous studies indicate that several proposed approaches fail to guarantee the generation of feasible solutions during the search process, thereby requiring a solution reconstruction. In this study, we propose a Genetic Algorithm (GA) designed to operate strictly within the feasible solution space of the BJSSP, where the objective function is the minimization of the makespan. Experimental results show that no specific factor levels significantly influenced the solution quality obtained by the GA across all problem sets. On the other hand, incorporating an assignment operator into the solution representation enhanced the diversity of the population. The proposed GA yields solutions that outperform some of the best-known makespan values for the Lawrence benchmark problems. The runtime of the GA ranged from 20 s for instances with 10 jobs and five machines to 600 s for instances with 30 jobs and 10 machines.

26 August 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JVJohn Valencia
John Valencia
ERElkin Rodríguez-Velásquez
Elkin Rodríguez-Velásquez
The blocking job shop problem (BJSSP) is a variant of the classical job shop problem, where a job completed on one machine cannot be transferred to the next machine until the latter becomes available, causing the current machine to remain blocked. Many real-world problems have been modeled as BJSSP. This problem is classified as strongly NP-hard. The existing literature indicates that some proposed methods fail to guarantee the generation of feasible solutions during the search process, necessitating solution reconstruction. In this study, we developed an Estimation Distribution Algorithm (EDA) designed to operate strictly within the BJSSP feasible solution space. The experiments showed that no specific levels of the factors were found to be significant in determining the quality of the solutions found by the EDA across all problem sets. On the other hand, incorporating assignment probabilities into the construction of EDA solutions facilitated diversity among the generated solutions. The runtime of the EDA for the proposed problem sets in the experiments, using the factor levels defined, ranged from 20 s for problems with 10 jobs and 5 machines to 600 s for those with 30 jobs and 10 machines. The proposed EDA begins by generating a random initial population of solutions. The makespan (Cmax) is then computed for each individual. The next generation is composed by three sets of individuals. The first group corresponds to a percentage of the best-performing individuals of the current generation. The second group is generated by using a probability distribution function derived from the structure of the selected solutions, while the remaining individuals are created randomly to enhance the algorithm’s exploratory capability. Our results demonstrate that the proposed method improves upon some of the previously best-known results in the current state of the art.