Sharing Temporal Knowledge by Multiple Agents. - Vicente J. Botti; Federico Barber; Alfons Crespo; Domingo Gallardo; Ismael Ripoll; Eva Onaindia; Luis Hernández 001 (DEXA, 1993)

A Metric Time-Point and Duration-Based Temporal Model. - Federico Barber (SIGART Bull., 1993)

Temporal Data Representation and Reasoning in REAKT. - Federico Barber; Vicent J. Botti; Eva Onaindia (AIRTC, 1994)

Multiple Access and Coherence Management in a Real-Time Temporal Blackboard. - Vicente J. Botti; Alfons Crespo; Federico Barber; Ismael Ripoll (ECAI, 1994)

Temporal Reasoning in REAKT: An Environment for Real-Time Knowledge-Based Systems. - Federico Barber; Vicente J. Botti; Eva Onaindia; Alfons Crespo (AI Commun., 1994)

A Temporal Blackboard for a Multi-Agent Environment. - Vicente J. Botti; Federico Barber; Alfons Crespo; Eva Onaindia; Ana García-Fornes; Ismael Ripoll; Domingo Gallardo; Luis Hernández 001 (Data Knowl. Eng., 1995)

A Progressive Heuristic Search Algorithm for the Cutting Stock Problem. - Eva Onaindia; Federico Barber; Vicente J. Botti; Carlos Carrascosa; Miguel A. Hernandez; Miguel Rebollo (IEA/AIE (Vol. 2), 1998)

Towards a Temporal Coherence Management in Real-Time Knowledge-Based Systems. - Vicente J. Botti; Federico Barber; Alfons Crespo (Data Knowl. Eng., 1998)

Scheduling in a Planning Environment. - Antonio Garrido Tejero; Miguel A. Salido; Federico Barber (PuK, 2000)

Heuristic Methods for Solving Job-Shop Scheduling Problems. - Antonio Garrido Tejero; Miguel A. Salido; Federico Barber; Montserrat Abril López (PuK, 2000)

Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts. - Federico Barber (J. Artif. Intell. Res., 2000)

An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. - Miguel A. Salido; Federico Barber (CP, 2001)

A Temporal Planning System for Time-Optimal Planning. - Antonio Garrido Tejero; Eva Onaindia; Federico Barber (EPIA, 2001)

Realizing a Global Hyperpolyhedron Constraint via LP Techniques. - Miguel A. Salido; Adriana Giret; Federico Barber (PuK, 2001)

Integrating Planning and Scheduling. - Antonio Garrido Tejero; Federico Barber (Appl. Artif. Intell., 2001)

Disjunction of Non-binary and Numeric Constraint Satisfaction Problems. - Miguel A. Salido; Federico Barber (CCIA, 2002)

Disjunctive and Continuous Constraint Satisfaction Problems. - Miguel A. Salido; Federico Barber (CP, 2002)

Problemas de Satisfaccion de Restricciones no Binarias con Dominios Continuos. - Miguel A. Salido; Adriana Giret; Federico Barber (Inteligencia Artif., 2002)

An Interactive Train Scheduling Tool for Solving and Plotting Running Maps. - Federico Barber; Miguel A. Salido; Laura Paola Ingolotti; Montserrat Abril; Antonio Luis Lova; María Pilar Tormos (CAEPIA, 2003)

Distributed Non-binary Constraints. - Miguel A. Salido; Federico Barber (CAEPIA, 2003)

How to Classify Hard and Soft Constraints in Non-binary Constraint Satisfaction Problems. - Miguel A. Salido; Federico Barber (SGAI Conf., 2003)

Introducción a la programación de restricciones. - Federico Barber; Miguel A. Salido (Inteligencia Artif., 2003)

A polynomial algorithm for continuous non-binary disjunctive CSPs: extended DLRs. - Miguel A. Salido; Federico Barber (Knowl. Based Syst., 2003)

Exploiting the Constrainedness in Constraint Satisfaction Problems. - Miguel A. Salido; Federico Barber (AIMSA, 2004)

Intelligent Train Scheduling on a High-Loaded Railway Network. - Antonio Luis Lova; María Pilar Tormos; Federico Barber; Laura Paola Ingolotti; Miguel A. Salido; Montserrat Abril (ATMOS, 2004)

An Efficient Method to Schedule New Trains on a Heavily Loaded Railway Network. - Laura Paola Ingolotti; Federico Barber; María Pilar Tormos; Antonio Luis Lova; Miguel A. Salido; Montserrat Abril (IBERAMIA, 2004)

Constrainedness and Redundancy by Constraint Ordering. - Miguel A. Salido; Federico Barber (IBERAMIA, 2004)

A Decision Support System (DSS) for the Railway Scheduling Problem. - Laura Paola Ingolotti; María Pilar Tormos; Antonio Luis Lova; Federico Barber; Miguel A. Salido; Montserrat Abril (AIAI, 2004)

A Non-Binary Constraint Ordering Approach to Scheduling Problems. - Miguel A. Salido; Federico Barber (SGAI Conf. (Applications), 2004)

A Topological Model Based on Railway Capacity to Manage Periodic Train Scheduling. - Miguel A. Salido; Federico Barber; Montserrat Abril; Pilar Tormos; Antonio Luis Lova; Laura Paola Ingolotti (SGAI Conf. (Applications), 2004)

A Mixed Closure-CSP Method for Solving Scheduling Problems. - María Isabel Alfonso; Federico Barber (Appl. Intell., 2004)

A Scheduling Order-Based Method to Solve Timetabling Problems. - Laura Paola Ingolotti; Federico Barber; María Pilar Tormos; Antonio Luis Lova; Miguel A. Salido; Montserrat Abril (CAEPIA, 2005)

A Heuristic Technique for the Capacity Assessment of Periodic Trains. - Montserrat Abril; Miguel A. Salido; Federico Barber; Laura Paola Ingolotti; Antonio Luis Lova; María Pilar Tormos (CCIA, 2005)

Distributed Constraints for Large-Scale Scheduling Problems. - Montserrat Abril; Miguel A. Salido; Federico Barber (CP, 2005)

Optimization in railway scheduling. - Miguel A. Salido; Montserrat Abril; Federico Barber; Laura Paola Ingolotti; Antonio Luis Lova; María Pilar Tormos (ICINCO, 2005)

New Heuristics to Solve the "CSOP" Railway Timetabling Problem. - Laura Paola Ingolotti; Antonio Luis Lova; Federico Barber; María Pilar Tormos; Miguel A. Salido; Montserrat Abril (IEA/AIE, 2006)

Domain Dependent Distributed Models for Railway Scheduling. - M. A. Salidol; Montserrat Abril; Federico Barber; Laura Paola Ingolotti; María Pilar Tormos; Antonio Luis Lova (SGAI Conf. (Applications), 2006)

Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules. - Antonio Luis Lova; María Pilar Tormos; Federico Barber (Inteligencia Artif., 2006)

Editorial 30. - Lawrence Mandow; Federico Barber (Inteligencia Artif., 2006)

Distributed CSPs by graph partitioning. - Miguel A. Salido; Federico Barber (Appl. Math. Comput., 2006)

DFS-Tree Based Heuristic Search. - Montserrat Abril; Miguel A. Salido; Federico Barber (SARA, 2007)

Editorial: 10th anniversary of Artificial Intelligence, Iberoamerican AI Journal. - Federico Barber (Inteligencia Artif., 2007)

OPTIHPER: A Computer-Based Decision Support System for Employee Timetabling Problems. - Antonio Luis Lova; María Pilar Tormos; Federico Barber (ERCIM News, 2007)

Domain-dependent distributed models for railway scheduling. - Miguel A. Salido; Montserrat Abril; Federico Barber; Laura Paola Ingolotti; María Pilar Tormos; Antonio Luis Lova (Knowl. Based Syst., 2007)

A Dynamic Population Steady-State Genetic Algorithm for the Resource-Constrained Project Scheduling Problem. - Mariamar Cervantes; Antonio Luis Lova; María Pilar Tormos; Federico Barber (IEA/AIE, 2008)

Distributed search in railway scheduling problems. - Montserrat Abril; Miguel A. Salido; Federico Barber (Eng. Appl. Artif. Intell., 2008)

A Genetic Algorithm for Railway Scheduling Problems. - María Pilar Tormos; Antonio Luis Lova; Federico Barber; Laura Paola Ingolotti; Montserrat Abril; Miguel A. Salido (Metaheuristics for Scheduling in Industrial and Manufacturing Applications, 2008)

AC3-OP: An Arc-Consistency Algorithm for Arithmetic Constraints. - Marlene Arangú; Miguel A. Salido; Federico Barber (CCIA, 2009)

Stability of Solutions in Constraint Satisfaction Problems. - Laura Climent; Miguel A. Salido; Federico Barber (CCIA, 2009)

An Artificial Intelligence Planning Tool for the Container Stacking Problem. - Miguel A. Salido; Óscar Sapena; Federico Barber (ETFA, 2009)

2-C3OP: An Improved Version of 2-Consistency. - Marlene Arangú; Miguel A. Salido; Federico Barber (ICTAI, 2009)

A Planning Tool for Minimizing Reshuffles in Container Terminals. - Miguel A. Salido; Óscar Sapena; Mario Rodríguez-Molins; Federico Barber (ICTAI, 2009)

2-C3: From Arc-Consistency to 2-Consistency. - Marlene Arangú; Miguel A. Salido; Federico Barber (SARA, 2009)

Extending arc-consistency algorithms for Non-Normalized CSPs. - Marlene Arangú; Miguel A. Salido; Federico Barber (SGAI Conf., 2009)

Experimental analysis of optimization techniques on the road passenger transportation problem. - Beatriz López 001; Víctor Muñoz; Javier Murillo; Federico Barber; Miguel A. Salido; Montserrat Abril; Mariamar Cervantes; Luis F. Caro; Mateu Villaret (Eng. Appl. Artif. Intell., 2009)

Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetabling. - Federico Barber; Laura Paola Ingolotti; Antonio Luis Lova; María Pilar Tormos; Miguel A. Salido (Robust and Online Large-Scale Optimization, 2009)

AC2001-OP: An Arc-Consistency Algorithm for Constraint Satisfaction Problems. - Marlene Arangú; Miguel A. Salido; Federico Barber (IEA/AIE (3), 2010)

Robust Solutions in Changing Constraint Satisfaction Problems. - Laura Climent; Miguel A. Salido; Federico Barber (IEA/AIE (1), 2010)

Domain-Dependent Planning Heuristics for Locating Containers in Maritime Terminals. - Mario Rodríguez-Molins; Miguel A. Salido; Federico Barber (IEA/AIE (1), 2010)

Artificial Intelligence Techniques for the Berth Allocation and Container Stacking Problems in Container Terminals. - Miguel A. Salido; Mario Rodríguez-Molins; Federico Barber (SGAI Conf., 2010)

Nogood-FC for solving partitionable constraint satisfaction problems. - Montserrat Abril; Miguel A. Salido; Federico Barber (J. Intell. Manuf., 2010)

Reformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions. - Laura Climent; Miguel A. Salido; Federico Barber (SARA, 2011)

Integrated intelligent techniques for remarshaling and berthing in maritime terminals. - Miguel A. Salido; Mario Rodríguez-Molins; Federico Barber (Adv. Eng. Informatics, 2011)

A Genetic Algorithm for Berth Allocation and Quay Crane Assignment. - Mario Rodríguez-Molins; Federico Barber; María R. Sierra; Jorge Puente 001; Miguel A. Salido (IBERAMIA, 2012)

An Algorithm for Finding Robust and Stable Solutions for Constraint Satisfaction Problems with Discrete and Ordered Domains. - Laura Climent; Richard J. Wallace; Miguel A. Salido; Federico Barber (ICTAI, 2012)

Robust Solutions to Job-Shop Scheduling Problems with Operators. - Joan Escamilla; Mario Rodríguez-Molins; Miguel A. Salido; María R. Sierra; Carlos Mencía; Federico Barber (ICTAI, 2012)

Intelligent planning for allocating containers in maritime terminals. - Mario Rodríguez-Molins; Miguel A. Salido; Federico Barber (Expert Syst. Appl., 2012)

Robustness for a single railway line: Analytical and simulation methods. - Miguel A. Salido; Federico Barber; Laura Paola Ingolotti (Expert Syst. Appl., 2012)

A decision support system for managing combinatorial problems in container terminals. - Miguel A. Salido; Mario Rodríguez-Molins; Federico Barber (Knowl. Based Syst., 2012)

Modeling Robustness in CSPs as Weighted CSPs. - Laura Climent; Richard J. Wallace; Miguel A. Salido; Federico Barber (CPAIOR, 2013)

Robustness and Stability in Constraint Programming under Dynamism and Uncertainty - (Extended Abstract). - Laura Climent; Richard J. Wallace; Miguel A. Salido; Federico Barber (CP, 2014)

PSPLIB-ENERGY: a extension of PSPLIB library to assess the energy optimization in the RCPSP. - Daniel Morillo 001; Federico Barber; Miguel A. Salido (Inteligencia Artif., 2014)

A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds. - Mario Rodríguez-Molins; Miguel A. Salido; Federico Barber (Appl. Intell., 2014)

Robustness and Stability in Constraint Programming under Dynamism and Uncertainty. - Laura Climent; Richard J. Wallace; Miguel A. Salido; Federico Barber (J. Artif. Intell. Res., 2014)

A genetic algorithm for robust berth allocation and quay crane assignment. - Mario Rodríguez-Molins; Laura Paola Ingolotti; Federico Barber; Miguel A. Salido; María R. Sierra; Jorge Puente 001 (Prog. Artif. Intell., 2014)

Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings. - Laura Climent; Richard J. Wallace; Miguel A. Salido; Federico Barber (Artif. Intell. Rev., 2015)

Robustness, stability, recoverability, and reliability in constraint satisfaction problems. - Federico Barber; Miguel A. Salido (Knowl. Inf. Syst., 2015)

Uncertainty in dynamic constraint satisfaction problems. - Laura Climent; Miguel A. Salido; Richard J. Wallace; Federico Barber (AI Commun., 2016)

Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems. - Miguel A. Salido; Joan Escamilla; Federico Barber; Adriana Giret; Dunbing Tang; Min Dai (Artif. Intell. Eng. Des. Anal. Manuf., 2016)

Optimisation System for Cutting Continuous Flat Glass. - José Francisco García Cantos; Manuel Peinado; Miguel A. Salido; Federico Barber (ERCIM News, 2016)

A metaheuristic technique for energy-efficiency in job-shop scheduling. - Joan Escamilla; Miguel A. Salido; Adriana Giret; Federico Barber (Knowl. Eng. Rev., 2016)

20 aniversario de 'INTELIGENCIA ARTIFICIAL'. - Federico Barber (Inteligencia Artif., 2017)

Chromosome Mutation vs. Gene Mutation in Evolutive Approaches for Solving the Resource-Constrained Project Scheduling Problem (RCPSP). - Daniel Morillo 001; Federico Barber; Miguel A. Salido (IEA/AIE, 2018)

Dynamic Rescheduling in Energy-Aware Unrelated Parallel Machine Problems. - Sergio Ferrer; Giancarlo Nicolò; Miguel A. Salido; Adriana Giret; Federico Barber (APMS (2), 2018)

A Multi-Agent Framework to Solve Energy-Aware Unrelated Parallel Machine Scheduling Problems with Machine-Dependent Energy Consumption and Sequence-Dependent Setup Time. - Giancarlo Nicolò; Sergio Ferrer; Miguel A. Salido; Adriana Giret; Federico Barber (ICAPS, 2019)