Jordi Pereira

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 22

Top Topics

Combinatorial Optimization

Heuristic Methods

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Int. J. Prod. Res.

Publications

Felipe Lagos, Jordi Pereira
Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems. Eur. J. Oper. Res. 312 (1) (2024)
Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem. Comput. Oper. Res. 166 (2024)
Jordi Pereira, Marcus Ritt
Exact and heuristic methods for a workload allocation problem with chain precedence constraints. Eur. J. Oper. Res. 309 (1) (2023)
Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà
Analysis of the simple assembly line balancing problem complexity. Comput. Oper. Res. 159 (2023)
Eduardo Álvarez-Miranda, Jordi Pereira, Camila Vargas, Mariona Vilà
Variable-depth local search heuristic for assembly line balancing problems. Int. J. Prod. Res. 61 (9) (2023)
Yaarit Miriam Cohen, Pinar Keskinocak, Jordi Pereira
A note on the flowtime network restoration problem. IISE Trans. 53 (12) (2021)
Igor Averbakh, Jordi Pereira
Tree optimization based heuristics and metaheuristics in network construction problems. Comput. Oper. Res. 128 (2021)
Jordi Pereira
An evolutionary and neighborhood-based algorithm for optimization under low budget requirements. GECCO Companion (2021)
Eduardo Álvarez-Miranda, Sebastián Chace, Jordi Pereira
Assembly line balancing with parallel workstations. Int. J. Prod. Res. 59 (21) (2021)
Sebastián Moreno, Jordi Pereira, Wilfredo F. Yushimito
A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution. Ann. Oper. Res. 286 (1) (2020)
Marcus Ritt, Jordi Pereira
Heuristic and exact algorithms for minimum-weight non-spanning arborescences. Eur. J. Oper. Res. 287 (1) (2020)
Igor Averbakh, Jordi Pereira
Tree Optimization Based Heuristics and Metaheuristics in Network Construction Problems. CoRR (2020)
Eduardo Álvarez-Miranda, Jordi Pereira
On the complexity of assembly line balancing problems. Comput. Oper. Res. 108 (2019)
Jordi Pereira
Modelling and solving a cost-oriented resource-constrained multi-model assembly line balancing problem. Int. J. Prod. Res. 56 (11) (2018)
Jordi Pereira
The robust (minmax regret) assembly line worker assignment and balancing problem. Comput. Oper. Res. 93 (2018)
Jordi Pereira, Marcus Ritt, Óscar C. Vásquez
A memetic algorithm for the cost-oriented robotic assembly line balancing problem. Comput. Oper. Res. 99 (2018)
Igor Averbakh, Jordi Pereira
Lateness Minimization in Pairwise Connectivity Restoration Problems. INFORMS J. Comput. 30 (3) (2018)
Jordi Pereira, Óscar C. Vásquez
The single machine weighted mean squared deviation problem. Eur. J. Oper. Res. 261 (2) (2017)
Eduardo Álvarez-Miranda, Jordi Pereira
Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach. Comput. Oper. Res. 81 (2017)
Christian Blum, Jordi Pereira
Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances. GECCO (2016)
Jordi Pereira
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. Comput. Oper. Res. 66 (2016)
Jordi Pereira
Procedures for the bin packing problem with precedence constraints. Eur. J. Oper. Res. 250 (3) (2016)
Jordi Pereira, Mariona Vilà
Variable neighborhood search heuristics for a test assembly design problem. Expert Syst. Appl. 42 (10) (2015)
Igor Averbakh, Jordi Pereira
Network construction problems with due dates. Eur. J. Oper. Res. 244 (3) (2015)
Mariona Vilà, Jordi Pereira
A branch-and-bound algorithm for assembly line worker assignment and balancing problems. Comput. Oper. Res. 44 (2014)
Mariona Vilà, Jordi Pereira
A note on 'Exact and approximate methods for a one-dimensional minimax bin-packing problem' [Annals of Operations Research (2013) 206: 611-626]. CoRR (2014)
Mariona Vilà, Jordi Pereira
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties. Comput. Oper. Res. 40 (7) (2013)
Mariona Vilà, Jordi Pereira
An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time. Eur. J. Oper. Res. 229 (1) (2013)
Jordi Pereira, Igor Averbakh
The Robust Set Covering Problem with interval data. Ann. Oper. Res. 207 (1) (2013)
Jordi Pereira, Igor Averbakh
Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38 (8) (2011)
Joaquín Bautista, Jordi Pereira
Procedures for the Time and Space constrained Assembly Line Balancing Problem. Eur. J. Oper. Res. 212 (3) (2011)
Joaquín Bautista, Jordi Pereira
A dynamic programming based heuristic for the assembly line balancing problem. Eur. J. Oper. Res. 194 (3) (2009)
Joaquín Bautista, Jordi Pereira, Belarmino Adenso-Díaz
A GRASP approach for the extended car sequencing problem. J. Sched. 11 (1) (2008)
Joaquín Bautista, Elena Fernández, Jordi Pereira
Solving an urban waste collection problem using ants heuristics. Comput. Oper. Res. 35 (9) (2008)
Manuel Chica, Oscar Cordón, Sergio Damas, Jordi Pereira, Joaquín Bautista
Incorporating Preferences to a Multi-objective Ant Colony Algorithm for Time and Space Assembly Line Balancing. ANTS Conference (2008)
Christian Blum, Joaquín Bautista, Jordi Pereira
An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem. EvoCOP (2008)
Joaquín Bautista, Jordi Pereira, Belarmino Adenso-Díaz
A Beam Search approach for the optimization version of the Car Sequencing Problem. Ann. Oper. Res. 159 (1) (2008)
Joaquín Bautista, Jordi Pereira
Ant algorithms for a time and space constrained assembly line balancing problem. Eur. J. Oper. Res. 177 (3) (2007)
Joaquín Bautista, Jordi Pereira
A GRASP algorithm to solve the unicost set covering problem. Comput. Oper. Res. 34 (10) (2007)
Christian Blum, Joaquín Bautista, Jordi Pereira
Beam-ACO Applied to Assembly Line Balancing. ANTS Workshop (2006)
Joaquín Bautista, Alberto Gómez, Jordi Pereira, Jesús Lozano Mosterín
Comparison Between Metaheuristic and Exact Models in the Packing Problem Resolution. IC-AI (2005)
Joaquín Bautista, Jordi Pereira
Ant Algorithms for Urban Waste Collection Routing. ANTS Workshop (2004)
Alberto Gómez, David de la Fuente, Joaquín Bautista, Jordi Pereira, Laia Ferrer
A Comparative Study of Simulated Annealing and Genetic Algorithms. IC-AI (2004)
Joaquín Bautista, Jordi Pereira
Ant Algorithms for Assembly Line Balancing. Ant Algorithms (2002)
Joaquín Bautista, Jordi Pereira
Ant Colonies for the RCPS Problem. CCIA (2002)