Adaptation of a Branching Algorithm to Solve the Multi-Objective Hamiltonian Cycle Problem. - Maialen Murua; Diego Galar; Roberto Santana 001 (OR, 2019)

Tool-Path Problem in Direct Energy Deposition Metal-Additive Manufacturing: Sequence Strategy Generation. - Maialen Murua; Alfredo Suárez; Diego Galar; Roberto Santana 001 (IEEE Access, 2020)

Solving the multi-objective Hamiltonian cycle problem using a Branch-and-Fix based algorithm. - Maialen Murua; Diego Galar; Roberto Santana 001 (J. Comput. Sci., 2022)

Solving large flexible job shop scheduling instances by generating a diverse set of scheduling policies with deep reinforcement learning. - Imanol Echeverria; Maialen Murua; Roberto Santana 001 (CoRR, 2023)

Multi-Assignment Scheduler: A New Behavioral Cloning Method for the Job-Shop Scheduling Problem. - Imanol Echeverria; Maialen Murua; Roberto Santana 001 (LION, 2024)

Offline reinforcement learning for job-shop scheduling problems. - Imanol Echeverria; Maialen Murua; Roberto Santana 001 (Appl. Soft Comput., 2025)

Diverse policy generation for the flexible job-shop scheduling problem via deep reinforcement learning with a novel graph representation. - Imanol Echeverria; Maialen Murua; Roberto Santana 001 (Eng. Appl. Artif. Intell., 2025)

Leveraging constraint programming in a deep learning approach for dynamically solving the flexible job-shop scheduling problem. - Imanol Echeverria; Maialen Murua; Roberto Santana 001 (Expert Syst. Appl., 2025)

Self-Evaluation for Job-Shop Scheduling. - Imanol Echeverria; Maialen Murua; Roberto Santana 001 (CoRR, 2025)