Jordi Pereira

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