default search action
Jordi Pereira
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j34]Eduardo Álvarez-Miranda
, Rafael Epstein
A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service. Comput. Oper. Res. 173: 106845 (2025) - 2024
- [j33]Eduardo Álvarez-Miranda
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem. Comput. Oper. Res. 166: 106597 (2024) - [j32]Felipe Lagos
Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems. Eur. J. Oper. Res. 312(1): 70-91 (2024) - 2023
- [j31]Eduardo Álvarez-Miranda
Analysis of the simple assembly line balancing problem complexity. Comput. Oper. Res. 159: 106323 (2023) - [j30]Jordi Pereira
Exact and heuristic methods for a workload allocation problem with chain precedence constraints. Eur. J. Oper. Res. 309(1): 387-398 (2023) - [j29]Eduardo Álvarez-Miranda
Variable-depth local search heuristic for assembly line balancing problems. Int. J. Prod. Res. 61(9): 3103-3121 (2023) - 2021
- [j28]Igor Averbakh, Jordi Pereira
Tree optimization based heuristics and metaheuristics in network construction problems. Comput. Oper. Res. 128: 105190 (2021) - [j27]Yaarit Miriam Cohen, Pinar Keskinocak, Jordi Pereira
A note on the flowtime network restoration problem. IISE Trans. 53(12): 1351-1352 (2021) - [j26]Eduardo Álvarez-Miranda
Assembly line balancing with parallel workstations. Int. J. Prod. Res. 59(21): 6486-6506 (2021) - [c10]Jordi Pereira:
An evolutionary and neighborhood-based algorithm for optimization under low budget requirements. GECCO Companion 2021: 17-18 - 2020
- [j25]Sebastián Moreno
A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution. Ann. Oper. Res. 286(1): 87-117 (2020) - [j24]Marcus Ritt
Heuristic and exact algorithms for minimum-weight non-spanning arborescences. Eur. J. Oper. Res. 287(1): 61-75 (2020) - [i2]Igor Averbakh, Jordi Pereira:
Tree Optimization Based Heuristics and Metaheuristics in Network Construction Problems. CoRR abs/2007.03425 (2020)
2010 – 2019
- 2019
- [j23]Eduardo Álvarez-Miranda
On the complexity of assembly line balancing problems. Comput. Oper. Res. 108: 182-186 (2019) - 2018
- [j22]Jordi Pereira
The robust (minmax regret) assembly line worker assignment and balancing problem. Comput. Oper. Res. 93: 27-40 (2018) - [j21]Jordi Pereira
A memetic algorithm for the cost-oriented robotic assembly line balancing problem. Comput. Oper. Res. 99: 249-261 (2018) - [j20]Jordi Pereira
Modelling and solving a cost-oriented resource-constrained multi-model assembly line balancing problem. Int. J. Prod. Res. 56(11): 3994-4016 (2018) - [j19]Igor Averbakh
Lateness Minimization in Pairwise Connectivity Restoration Problems. INFORMS J. Comput. 30(3): 522-538 (2018) - 2017
- [j18]Eduardo Álvarez-Miranda
Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach. Comput. Oper. Res. 81: 178-191 (2017) - [j17]Jordi Pereira
The single machine weighted mean squared deviation problem. Eur. J. Oper. Res. 261(2): 515-529 (2017) - 2016
- [j16]Jordi Pereira
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. Comput. Oper. Res. 66: 141-152 (2016) - [j15]Jordi Pereira
Procedures for the bin packing problem with precedence constraints. Eur. J. Oper. Res. 250(3): 794-806 (2016) - [c9]Christian Blum
Extension of the CMSA Algorithm: An LP-based Way for Reducing Sub-instances. GECCO 2016: 285-292 - 2015
- [j14]Igor Averbakh, Jordi Pereira
Network construction problems with due dates. Eur. J. Oper. Res. 244(3): 715-729 (2015) - [j13]Jordi Pereira
Variable neighborhood search heuristics for a test assembly design problem. Expert Syst. Appl. 42(10): 4805-4817 (2015) - 2014
- [j12]Mariona Vilà
A branch-and-bound algorithm for assembly line worker assignment and balancing problems. Comput. Oper. Res. 44: 105-114 (2014) - [i1]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 abs/1402.1616 (2014) - 2013
- [j11]Jordi Pereira
The Robust Set Covering Problem with interval data. Ann. Oper. Res. 207(1): 217-235 (2013) - [j10]Mariona Vilà
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties. Comput. Oper. Res. 40(7): 1819-1828 (2013) - [j9]Mariona Vilà
An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time. Eur. J. Oper. Res. 229(1): 106-113 (2013) - 2011
- [j8]Jordi Pereira
Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38(8): 1153-1163 (2011) - [j7]Joaquín Bautista
Procedures for the Time and Space constrained Assembly Line Balancing Problem. Eur. J. Oper. Res. 212(3): 473-481 (2011)
2000 – 2009
- 2009
- [j6]Joaquín Bautista
A dynamic programming based heuristic for the assembly line balancing problem. Eur. J. Oper. Res. 194(3): 787-794 (2009) - 2008
- [j5]Joaquín Bautista
A Beam Search approach for the optimization version of the Car Sequencing Problem. Ann. Oper. Res. 159(1): 233-244 (2008) - [j4]Joaquín Bautista
Solving an urban waste collection problem using ants heuristics. Comput. Oper. Res. 35(9): 3020-3033 (2008) - [j3]Joaquín Bautista
A GRASP approach for the extended car sequencing problem. J. Sched. 11(1): 3-16 (2008) - [c8]Manuel Chica
Incorporating Preferences to a Multi-objective Ant Colony Algorithm for Time and Space Assembly Line Balancing. ANTS Conference 2008: 331-338 - [c7]Christian Blum
An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem. EvoCOP 2008: 85-96 - 2007
- [j2]Joaquín Bautista
A GRASP algorithm to solve the unicost set covering problem. Comput. Oper. Res. 34(10): 3162-3173 (2007) - [j1]Joaquín Bautista
Ant algorithms for a time and space constrained assembly line balancing problem. Eur. J. Oper. Res. 177(3): 2016-2032 (2007) - 2006
- [c6]Christian Blum, Joaquín Bautista, Jordi Pereira:
Beam-ACO Applied to Assembly Line Balancing. ANTS Workshop 2006: 96-107 - 2005
- [c5]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: 435-441 - 2004
- [c4]Joaquín Bautista, Jordi Pereira:
Ant Algorithms for Urban Waste Collection Routing. ANTS Workshop 2004: 302-309 - [c3]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: 3-9 - 2002
- [c2]Joaquín Bautista, Jordi Pereira:
Ant Algorithms for Assembly Line Balancing. Ant Algorithms 2002: 65-75 - [c1]Joaquín Bautista, Jordi Pereira:
Ant Colonies for the RCPS Problem. CCIA 2002: 257-268
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: