Imanol Echeverria

Imanol Echeverria

Auto-generated profile, based on publicly available information

Imanol Echeverria

Computer Science and Artificial Intelligence Department Basque Research and Technology Alliance (BRTA) Basque Research and Technology Alliance (BRTA) University of the Basque Country

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
7 December 2024 in Expert Systems with Applications
Verified
Journal Article
Open access
IEImanol Echeverria
Imanol Echeverria
MMMaialen Murua
Maialen Murua
RSRoberto Santana
Roberto Santana

24 October 2024 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Open access
IEImanol Echeverria
Imanol Echeverria
MMMaialen Murua
Maialen Murua
RSRoberto Santana
Roberto Santana

18 August 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
IEImanol Echeverria
Imanol Echeverria
MMMaialen Murua
Maialen Murua
RSRoberto Santana
Roberto Santana

12 February 2025 in arXiv
Verified
Preprint
Open access
PDF file
IEImanol Echeverria
Imanol Echeverria
MMMaialen Murua
Maialen Murua
RSRoberto Santana
Roberto Santana
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.


30 January 2024 in arXiv
Verified
Preprint
Open access
PDF file
IEImanol Echeverria
Imanol Echeverria
MMMaialen Murua
Maialen Murua
RSRoberto Santana
Roberto Santana
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.