Imanol Echeverria
Imanol Echeverria has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Maialen Murua
Basque Research and Technology Alliance (BRTA)
5 shared publications - Roberto Santana
University of the Basque Country
5 shared publications Maialen Murua
2 shared publications- David Guillén
Fersa Bearings
1 shared publication - Emmanouil Bakopoulos
Laboratory for Manufacturing Systems & Automation, Department of Mechanical Engineering and Aeronautics, University of Patras, Rio, Patras, 26504, Greece
1 shared publication - Fernando Cebrian
Fersa Bearings, Calle Bari 37, 50197 Zaragoza, Spain
1 shared publication
Latest Publications
- 18 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 184
Offline reinforcement learning for job-shop scheduling problems
- 18 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 184
Offline reinforcement learning for job-shop scheduling problems
- Open Access
Self-Evaluation for Job-Shop Scheduling
Combinatorial optimization problems, such as scheduling and route planning, are crucial in various industries but are computationally intractable due to their NP-hard nature. Neural Combinatorial Optimization methods leverage machine learning to address these challenges but often depend on sequential decision-making, which is prone to error accumulation as small mistakes propagate throughout the process. Inspired by self-evaluation techniques in Large Language Models, we propose a novel framework that generates and evaluates subsets of assignments, moving beyond traditional stepwise approaches. Applied to the Job-Shop Scheduling Problem, our method integrates a heterogeneous graph neural network with a Transformer to build a policy model and a self-evaluation function. Experimental validation on challenging, well-known benchmarks demonstrates the effectiveness of our approach, surpassing state-of-the-art methods.
Open AccessSelf-Evaluation for Job-Shop Scheduling
Combinatorial optimization problems, such as scheduling and route planning, are crucial in various industries but are computationally intractable due to their NP-hard nature. Neural Combinatorial Optimization methods leverage machine learning to address these challenges but often depend on sequential decision-making, which is prone to error accumulation as small mistakes propagate throughout the process. Inspired by self-evaluation techniques in Large Language Models, we propose a novel framework that generates and evaluates subsets of assignments, moving beyond traditional stepwise approaches. Applied to the Job-Shop Scheduling Problem, our method integrates a heterogeneous graph neural network with a Transformer to build a policy model and a self-evaluation function. Experimental validation on challenging, well-known benchmarks demonstrates the effectiveness of our approach, surpassing state-of-the-art methods.
- 3 January 2025
- Published by Springer Nature
- p. 138-152
Multi-Assignment Scheduler: A New Behavioral Cloning Method for the Job-Shop Scheduling Problem
- 3 January 2025
- Published by Springer Nature
- p. 138-152
Multi-Assignment Scheduler: A New Behavioral Cloning Method for the Job-Shop Scheduling Problem
- Open Access
- 7 December 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 265
Leveraging constraint programming in a deep learning approach for dynamically solving the flexible job-shop scheduling problem
- 7 December 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 265
Open AccessLeveraging constraint programming in a deep learning approach for dynamically solving the flexible job-shop scheduling problem
- Open Access
- 24 October 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 139
Diverse policy generation for the flexible job-shop scheduling problem via deep reinforcement learning with a novel graph representation
- 24 October 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 139
Open AccessDiverse policy generation for the flexible job-shop scheduling problem via deep reinforcement learning with a novel graph representation
- Open Access
Leveraging Constraint Programming in a Deep Learning Approach for Dynamically Solving the Flexible Job-Shop Scheduling Problem
Recent advancements in the flexible job-shop scheduling problem (FJSSP) are primarily based on deep reinforcement learning (DRL) due to its ability to generate high-quality, real-time solutions. However, DRL approaches often fail to fully harness the strengths of existing techniques such as exact methods or constraint programming (CP), which can excel at finding optimal or near-optimal solutions for smaller instances. This paper aims to integrate CP within a deep learning (DL) based methodology, leveraging the benefits of both. In this paper, we introduce a method that involves training a DL model using optimal solutions generated by CP, ensuring the model learns from high-quality data, thereby eliminating the need for the extensive exploration typical in DRL and enhancing overall performance. Further, we integrate CP into our DL framework to jointly construct solutions, utilizing DL for the initial complex stages and transitioning to CP for optimal resolution as the problem is simplified. Our hybrid approach has been extensively tested on three public FJSSP benchmarks, demonstrating superior performance over five state-of-the-art DRL approaches and a widely-used CP solver. Additionally, with the objective of exploring the application to other combinatorial optimization problems, promising preliminary results are presented on applying our hybrid approach to the traveling salesman problem, combining an exact method with a well-known DRL method.
Open AccessLeveraging Constraint Programming in a Deep Learning Approach for Dynamically Solving the Flexible Job-Shop Scheduling Problem
Recent advancements in the flexible job-shop scheduling problem (FJSSP) are primarily based on deep reinforcement learning (DRL) due to its ability to generate high-quality, real-time solutions. However, DRL approaches often fail to fully harness the strengths of existing techniques such as exact methods or constraint programming (CP), which can excel at finding optimal or near-optimal solutions for smaller instances. This paper aims to integrate CP within a deep learning (DL) based methodology, leveraging the benefits of both. In this paper, we introduce a method that involves training a DL model using optimal solutions generated by CP, ensuring the model learns from high-quality data, thereby eliminating the need for the extensive exploration typical in DRL and enhancing overall performance. Further, we integrate CP into our DL framework to jointly construct solutions, utilizing DL for the initial complex stages and transitioning to CP for optimal resolution as the problem is simplified. Our hybrid approach has been extensively tested on three public FJSSP benchmarks, demonstrating superior performance over five state-of-the-art DRL approaches and a widely-used CP solver. Additionally, with the objective of exploring the application to other combinatorial optimization problems, promising preliminary results are presented on applying our hybrid approach to the traveling salesman problem, combining an exact method with a well-known DRL method.
- Open Access
- 9 February 2024
- Published by Springer Nature
- p. 251-263
A Multi-intelligent Agent Solution in the Automotive Component–Manufacturing Industry
The manufacturing industry is an ecosystem full of changes and variations where production conditions are never the same. As an example, the raw materials received from suppliers differ from one another, though within tolerances. And similar variations appear in all areas of manufacturing, such as tool wearing, the statuses of production machines, and even operator decisions.Improvements to production must factor in technical considerations and economic ones. Several points of view must be included to determine the best solution. Even when applying artificial intelligence (AI) in the manufacturing process, the situation should be similar: Several agents with different goals should interact to determine the most holistic solution.This paper presents the ontology, semantics, and architecture that facilitates multiagent interaction. The Reference Architecture Model Industry 4.0, or RAMI 4.0 (RAMI4.0 – 2018 – DE (plattform-i40.de)), has been selected as the basis for this approach.Given that most of the time, the operator’s decision is based on intuition and experience, not based on data analysis, this paper also analyses which data architecture will permit the data analysis of raw materials, finished products, tooling characteristics and statuses, machine parameters, and external conditions, to minimize the influence of intuition and personal bias on decision-making in manufacturing.
- 9 February 2024
- Published by Springer Nature
- p. 251-263
Open AccessA Multi-intelligent Agent Solution in the Automotive Component–Manufacturing Industry
The manufacturing industry is an ecosystem full of changes and variations where production conditions are never the same. As an example, the raw materials received from suppliers differ from one another, though within tolerances. And similar variations appear in all areas of manufacturing, such as tool wearing, the statuses of production machines, and even operator decisions.Improvements to production must factor in technical considerations and economic ones. Several points of view must be included to determine the best solution. Even when applying artificial intelligence (AI) in the manufacturing process, the situation should be similar: Several agents with different goals should interact to determine the most holistic solution.This paper presents the ontology, semantics, and architecture that facilitates multiagent interaction. The Reference Architecture Model Industry 4.0, or RAMI 4.0 (RAMI4.0 – 2018 – DE (plattform-i40.de)), has been selected as the basis for this approach.Given that most of the time, the operator’s decision is based on intuition and experience, not based on data analysis, this paper also analyses which data architecture will permit the data analysis of raw materials, finished products, tooling characteristics and statuses, machine parameters, and external conditions, to minimize the influence of intuition and personal bias on decision-making in manufacturing.
- Open Access
Solving the flexible job-shop scheduling problem through an enhanced deep reinforcement learning approach
In scheduling problems common in the industry and various real-world scenarios, responding in real-time to disruptive events is essential. Recent methods propose the use of deep reinforcement learning (DRL) to learn policies capable of generating solutions under this constraint. The objective of this paper is to introduce a new DRL method for solving the flexible job-shop scheduling problem, particularly for large instances. The approach is based on the use of heterogeneous graph neural networks to a more informative graph representation of the problem. This novel modeling of the problem enhances the policy's ability to capture state information and improve its decision-making capacity. Additionally, we introduce two novel approaches to enhance the performance of the DRL approach: the first involves generating a diverse set of scheduling policies, while the second combines DRL with dispatching rules (DRs) constraining the action space. Experimental results on two public benchmarks show that our approach outperforms DRs and achieves superior results compared to three state-of-the-art DRL methods, particularly for large instances.
Open AccessSolving the flexible job-shop scheduling problem through an enhanced deep reinforcement learning approach
In scheduling problems common in the industry and various real-world scenarios, responding in real-time to disruptive events is essential. Recent methods propose the use of deep reinforcement learning (DRL) to learn policies capable of generating solutions under this constraint. The objective of this paper is to introduce a new DRL method for solving the flexible job-shop scheduling problem, particularly for large instances. The approach is based on the use of heterogeneous graph neural networks to a more informative graph representation of the problem. This novel modeling of the problem enhances the policy's ability to capture state information and improve its decision-making capacity. Additionally, we introduce two novel approaches to enhance the performance of the DRL approach: the first involves generating a diverse set of scheduling policies, while the second combines DRL with dispatching rules (DRs) constraining the action space. Experimental results on two public benchmarks show that our approach outperforms DRs and achieves superior results compared to three state-of-the-art DRL methods, particularly for large instances.