Jordi Pereira

According to our database, Jordi Pereira authored at least 45 papers between 2002 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service.

Eduardo Álvarez-Miranda, Rafael Epstein, Jordi Pereira, Markus Sinnl, Rodolfo Urrutia

Comput. Oper. Res., 2025

2024

Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems.

Felipe Lagos, Jordi Pereira

Eur. J. Oper. Res., January, 2024

A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem.

Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà

Comput. Oper. Res., 2024

2023

Analysis of the simple assembly line balancing problem complexity.

Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà

Comput. Oper. Res., November, 2023

Exact and heuristic methods for a workload allocation problem with chain precedence constraints.

Jordi Pereira, Marcus Ritt

Eur. J. Oper. Res., August, 2023

Variable-depth local search heuristic for assembly line balancing problems.

Eduardo Álvarez-Miranda, Jordi Pereira, Camila Vargas, Mariona Vilà

Int. J. Prod. Res., May, 2023

2021

Assembly line balancing with parallel workstations.

Eduardo Álvarez-Miranda, Sebastián Chace, Jordi Pereira

Int. J. Prod. Res., 2021

A note on the flowtime network restoration problem.

Yaarit Miriam Cohen, Pinar Keskinocak, Jordi Pereira

IISE Trans., 2021

Tree optimization based heuristics and metaheuristics in network construction problems.

Igor Averbakh, Jordi Pereira

Comput. Oper. Res., 2021

An evolutionary and neighborhood-based algorithm for optimization under low budget requirements.

Jordi Pereira

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020

Heuristic and exact algorithms for minimum-weight non-spanning arborescences.

Marcus Ritt, Jordi Pereira

Eur. J. Oper. Res., 2020

A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution.

Sebastián Moreno, Jordi Pereira, Wilfredo F. Yushimito

Ann. Oper. Res., 2020

2019

On the complexity of assembly line balancing problems.

Eduardo Álvarez-Miranda, Jordi Pereira

Comput. Oper. Res., 2019

2018

Lateness Minimization in Pairwise Connectivity Restoration Problems.

Igor Averbakh, Jordi Pereira

INFORMS J. Comput., 2018

Modelling and solving a cost-oriented resource-constrained multi-model assembly line balancing problem.

Jordi Pereira

Int. J. Prod. Res., 2018

A memetic algorithm for the cost-oriented robotic assembly line balancing problem.

Jordi Pereira, Marcus Ritt, Óscar C. Vásquez

Comput. Oper. Res., 2018

The robust (minmax regret) assembly line worker assignment and balancing problem.

Jordi Pereira

Comput. Oper. Res., 2018

2017

The single machine weighted mean squared deviation problem.

Jordi Pereira, Óscar C. Vásquez

Eur. J. Oper. Res., 2017

Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach.

Eduardo Álvarez-Miranda, Jordi Pereira

Comput. Oper. Res., 2017

2016

Procedures for the bin packing problem with precedence constraints.

Jordi Pereira

Eur. J. Oper. Res., 2016

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective.

Jordi Pereira

Comput. Oper. Res., 2016

Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances.

Christian Blum, Jordi Pereira

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015

Variable neighborhood search heuristics for a test assembly design problem.

Jordi Pereira, Mariona Vilà

Expert Syst. Appl., 2015

Network construction problems with due dates.

Igor Averbakh, Jordi Pereira

Eur. J. Oper. Res., 2015

2014

A note on 'Exact and approximate methods for a one-dimensional minimax bin-packing problem' [Annals of Operations Research (2013) 206: 611-626].

Mariona Vilà, Jordi Pereira

CoRR, 2014

A branch-and-bound algorithm for assembly line worker assignment and balancing problems.

Mariona Vilà, Jordi Pereira

Comput. Oper. Res., 2014

2013

An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time.

Mariona Vilà, Jordi Pereira

Eur. J. Oper. Res., 2013

Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties.

Mariona Vilà, Jordi Pereira

Comput. Oper. Res., 2013

The Robust Set Covering Problem with interval data.

Jordi Pereira, Igor Averbakh

Ann. Oper. Res., 2013

2011

Procedures for the Time and Space constrained Assembly Line Balancing Problem.

Joaquín Bautista, Jordi Pereira

Eur. J. Oper. Res., 2011

Exact and heuristic algorithms for the interval data robust assignment problem.

Jordi Pereira, Igor Averbakh

Comput. Oper. Res., 2011

2009

A dynamic programming based heuristic for the assembly line balancing problem.

Joaquín Bautista, Jordi Pereira

Eur. J. Oper. Res., 2009

2008

A GRASP approach for the extended car sequencing problem.

Joaquín Bautista, Jordi Pereira, Belarmino Adenso-Díaz

J. Sched., 2008

Solving an urban waste collection problem using ants heuristics.

Joaquín Bautista, Elena Fernández, Jordi Pereira

Comput. Oper. Res., 2008

A Beam Search approach for the optimization version of the Car Sequencing Problem.

Joaquín Bautista, Jordi Pereira, Belarmino Adenso-Díaz

Ann. Oper. Res., 2008

An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem.

Christian Blum, Joaquín Bautista, Jordi Pereira

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

Incorporating Preferences to a Multi-objective Ant Colony Algorithm for Time and Space Assembly Line Balancing.

Manuel Chica, Oscar Cordón, Sergio Damas, Jordi Pereira, Joaquín Bautista

Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008

2007

Ant algorithms for a time and space constrained assembly line balancing problem.

Joaquín Bautista, Jordi Pereira

Eur. J. Oper. Res., 2007

A GRASP algorithm to solve the unicost set covering problem.

Joaquín Bautista, Jordi Pereira

Comput. Oper. Res., 2007

2006

Beam-ACO Applied to Assembly Line Balancing.

Christian Blum, Joaquín Bautista, Jordi Pereira

Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2006

2005

Comparison Between Metaheuristic and Exact Models in the Packing Problem Resolution.

Joaquín Bautista, Alberto Gómez, Jordi Pereira, Jesús Lozano Mosterín

Proceedings of the 2005 International Conference on Artificial Intelligence, 2005

2004

A Comparative Study of Simulated Annealing and Genetic Algorithms.

Alberto Gómez, David de la Fuente, Joaquín Bautista, Jordi Pereira, Laia Ferrer

Proceedings of the International Conference on Artificial Intelligence, 2004

Ant Algorithms for Urban Waste Collection Routing.

Joaquín Bautista, Jordi Pereira

Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

2002

Ant Colonies for the RCPS Problem.

Joaquín Bautista, Jordi Pereira

Proceedings of the Topics in Artificial Intelligence, 5th Catalonian Conference on AI, 2002

Ant Algorithms for Assembly Line Balancing.

Joaquín Bautista, Jordi Pereira

Proceedings of the Ant Algorithms, Third International Workshop, 2002