Ant Algorithms for Assembly Line Balancing. - Joaquín Bautista; Jordi Pereira (Ant Algorithms, 2002)

Ant Colonies for the RCPS Problem. - Joaquín Bautista; Jordi Pereira (CCIA, 2002)

Ant Algorithms for Urban Waste Collection Routing. - Joaquín Bautista; Jordi Pereira (ANTS Workshop, 2004)

A Comparative Study of Simulated Annealing and Genetic Algorithms. - Alberto Gómez 001; David de la Fuente; Joaquín Bautista; Jordi Pereira; Laia Ferrer (IC-AI, 2004)

Comparison Between Metaheuristic and Exact Models in the Packing Problem Resolution. - Joaquín Bautista; Alberto Gómez 001; Jordi Pereira; Jesús Lozano Mosterín (IC-AI, 2005)

Beam-ACO Applied to Assembly Line Balancing. - Christian Blum 001; Joaquín Bautista; Jordi Pereira (ANTS Workshop, 2006)

A GRASP algorithm to solve the unicost set covering problem. - Joaquín Bautista; Jordi Pereira (Comput. Oper. Res., 2007)

Ant algorithms for a time and space constrained assembly line balancing problem. - Joaquín Bautista; Jordi Pereira (Eur. J. Oper. Res., 2007)

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 (ANTS Conference, 2008)

An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem. - Christian Blum 001; Joaquín Bautista; Jordi Pereira (EvoCOP, 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)

Solving an urban waste collection problem using ants heuristics. - Joaquín Bautista; Elena Fernández 001; Jordi Pereira (Comput. Oper. Res., 2008)

A GRASP approach for the extended car sequencing problem. - Joaquín Bautista; Jordi Pereira; Belarmino Adenso-Díaz (J. Sched., 2008)

A dynamic programming based heuristic for the assembly line balancing problem. - Joaquín Bautista; Jordi Pereira (Eur. J. Oper. Res., 2009)

Exact and heuristic algorithms for the interval data robust assignment problem. - Jordi Pereira; Igor Averbakh (Comput. Oper. Res., 2011)

Procedures for the Time and Space constrained Assembly Line Balancing Problem. - Joaquín Bautista; Jordi Pereira (Eur. J. Oper. Res., 2011)

The Robust Set Covering Problem with interval data. - Jordi Pereira; Igor Averbakh (Ann. 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)

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)

A branch-and-bound algorithm for assembly line worker assignment and balancing problems. - Mariona Vilà; Jordi Pereira (Comput. Oper. Res., 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)

Network construction problems with due dates. - Igor Averbakh; Jordi Pereira (Eur. J. Oper. Res., 2015)

Variable neighborhood search heuristics for a test assembly design problem. - Jordi Pereira; Mariona Vilà (Expert Syst. Appl., 2015)

Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances. - Christian Blum 001; Jordi Pereira (GECCO, 2016)

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. - Jordi Pereira (Comput. Oper. Res., 2016)

Procedures for the bin packing problem with precedence constraints. - Jordi Pereira (Eur. J. Oper. Res., 2016)

Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach. - Eduardo Álvarez-Miranda; Jordi Pereira (Comput. Oper. Res., 2017)

The single machine weighted mean squared deviation problem. - Jordi Pereira; Óscar C. Vásquez 001 (Eur. J. Oper. Res., 2017)

The robust (minmax regret) assembly line worker assignment and balancing problem. - Jordi Pereira (Comput. Oper. Res., 2018)

A memetic algorithm for the cost-oriented robotic assembly line balancing problem. - Jordi Pereira; Marcus Ritt; Óscar C. Vásquez 001 (Comput. Oper. Res., 2018)

Modelling and solving a cost-oriented resource-constrained multi-model assembly line balancing problem. - Jordi Pereira (Int. J. Prod. Res., 2018)

Lateness Minimization in Pairwise Connectivity Restoration Problems. - Igor Averbakh; Jordi Pereira (INFORMS J. Comput., 2018)

On the complexity of assembly line balancing problems. - Eduardo Álvarez-Miranda; Jordi Pereira (Comput. Oper. Res., 2019)

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)

Heuristic and exact algorithms for minimum-weight non-spanning arborescences. - Marcus Ritt; Jordi Pereira (Eur. J. Oper. Res., 2020)

An evolutionary and neighborhood-based algorithm for optimization under low budget requirements. - Jordi Pereira (GECCO Companion, 2021)

Tree optimization based heuristics and metaheuristics in network construction problems. - Igor Averbakh; Jordi Pereira (Comput. Oper. Res., 2021)

A note on the flowtime network restoration problem. - Yaarit Miriam Cohen; Pinar Keskinocak; Jordi Pereira (IISE Trans., 2021)

Assembly line balancing with parallel workstations. - Eduardo Álvarez-Miranda; Sebastián Chace; Jordi Pereira (Int. J. Prod. Res., 2021)

Variable-depth local search heuristic for assembly line balancing problems. - Eduardo Álvarez-Miranda; Jordi Pereira; Camila Vargas; Mariona Vilà (Int. J. Prod. Res., 2023)

Exact and heuristic methods for a workload allocation problem with chain precedence constraints. - Jordi Pereira; Marcus Ritt (Eur. J. Oper. Res., 2023)

Analysis of the simple assembly line balancing problem complexity. - Eduardo Álvarez-Miranda; Jordi Pereira; Mariona Vilà (Comput. Oper. Res., 2023)

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)

Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems. - Felipe Lagos; Jordi Pereira (Eur. J. Oper. Res., 2024)

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)

New solution approaches for balancing assembly lines with setup times. - Jordi Pereira; Marcus Ritt (Comput. Oper. Res., 2025)