F
Federico Barber
Researcher at Polytechnic University of Valencia
Publications - 140
Citations - 2018
Federico Barber is an academic researcher from Polytechnic University of Valencia. The author has contributed to research in topics: Constraint satisfaction problem & Local consistency. The author has an hindex of 23, co-authored 123 publications receiving 1844 citations. Previous affiliations of Federico Barber include University of Valencia.
Papers
More filters
Journal ArticleDOI
An Assessment of Railway Capacity
TL;DR: In this paper, an in-depth study of the main factors that in∞uence railway capacity is performed on several Spanish railway infrastructures, and the results show how the capacity varies according to factors such as train speed, commercial stops, train heterogeneity, distance between railway signals, and timetable robustness.
Journal ArticleDOI
An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes
TL;DR: A hybrid Genetic Algorithm (MM-HGA) is developed to solve the multi-mode Resource Constrained Project Scheduling Problem (MRCPSP) and its main contributions are the mode assignment procedure, the fitness function and the use of a very efficient improving method.
Journal ArticleDOI
A genetic algorithm for energy-efficiency in job-shop scheduling
TL;DR: A genetic algorithm is developed to solve an extended version of the Job-shop Scheduling Problem in which machines can consume different amounts of energy to process tasks at different rates (speed scaling).
Journal ArticleDOI
Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules
TL;DR: This work deals with the multi-mode resource-constrained project scheduling problem, and multi-pass heuristics based on priority rules that outperforms the deterministic multi- pass heuristic previously published are designed.
Book ChapterDOI
A Genetic Algorithm for Railway Scheduling Problems
TL;DR: The results of the computational experience point out that GA is an appropriate method to explore the search space of this complex problems and able to lead to good solutions in a short amount of time.