Publications (Indexed in WoS Journal Citation Reports)

  1. Álvarez-Miranda, E., Pereira, J., Vilà, M., A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem, Computers and Operations Research 166, 106597. DOI: 10.1016/j.cor.2024.106597
  2. Álvarez-Miranda, E., Pereira, J., Vilà, M., Analysis of the Simple Assembly Line Balancing Problem Complexity, Computers and Operations Research 159, 106323. DOI: 10.1016/j.cor.2023.106323
  3. Lagos, F., Pereira, J., Multi-Armed Bandit-Based Hyper-Heuristics for Combinatorial Optimization Problems,European Journal of Operational Research 312, 70-91, 2024. DOI: 10.1016/j.ejor.2023.06.016.
  4. Pereira, J., Ritt, M., Exact and heuristic methods for a workload allocation problem with chain precedence constraints , European Journal of Operational Research 309, 387-398, 2023. DOI: 10.1016/j.ejor.2022.12.035.
  5. Álvarez-Miranda, E., Pereira, J., Vargas, C., Vilà, M., Variable-depth local search heuristic for assembly line balancing problem , International Journal of Production Research 61, 3103-3121, 2023. DOI: 10.1080/00207543.2022.2077673.
  6. Pereira, J., Ritt, M., A note on "Algorithms for the Calzedonia workload allocation problem", Journal of the Operational Research Society 73, 1420-1422, 2022. DOI: 10.1080/01605682.2021.1895685.
  7. Sandoval, M.G., Álvarez-Mirada, E., Pereira, J., Ríos-Mercado, R.Z., Díaz, J.A., A novel districting design approach for on-time last-mile delivery: An application on an express postal company, Omega 113, 102687, 2022. DOI: 10.1016/j.omega.2022.102687.
  8. Yuraszeck, F., Mejía, G., Pereira, J., Vilà, M., A Novel Constraint Programming Decomposition Approach for the Total Flow Time Fixed Group Shop Scheduling Problem , Mathematics 10, 329, 2022: DOI: 10.3390/math10030329.
  9. Álvarez-Miranda, E., Pereira, J., A districting application with a quality of service objective, Mathematics 10, 13, 2022. DOI: 10.3390/math10010013.
  10. Opazo, D., Moreno, S., Álvarez-Miranda, E., and Pereira, J., Analysis of First-Year University Student Dropout through Machine Learning Models: A Comparison between Universities, Mathematics 9, 2599, 2021. DOI: 10.3390/math9202599.
  11. Álvarez-Miranda, E., Chace, S., and Pereira, J., Assembly line balancing with parallel workstations, International Journal of Production Research 59, 6486-6506, 2021. DOI: 10.1080/00207543.2020.1818000.
  12. Álvarez-Miranda, E., Pereira, J., Torrez-Meruvia, H., and Vilà, M.,A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations., Mathematics 9, 2157, 2021. DOI: 10.3390/math9172157.
  13. Cohen, Y.M., Keskinocak, P., and Pereira, J., A note on the flowtime network restoration problem, IISE Transactions 53, 1351-1352, 2021. DOI: 10.1080/24725854.2020.1869353.
  14. Campos-Valdés, C., Álvarez-Miranda, E., Morales Quiroga, M., Pereira, J. and Liberona Durán, F.,The impact of candidates' profile and campaign decisions in electoral results: A data analytics approach., Mathematics 9, 902, 2021. DOI: 10.3390/math9080902.
  15. Averbakh, I., and Pereira, J., Tree optimization based heuristics and metaheuristics in network construction problems, Computers and Operations Research 128, 105190, 2021. DOI: 10.1016/j.cor.2020.105190.
  16. Álvarez-Miranda, E., Campos-Valdés, C., Morales, M., Moreno-Faguett, M., and Pereira, J., A multi-criteria pen for drawing fair districts: when democratic and demographic fairness matter, Mathematics 8, 1404/1-26, 2020. DOI: 10.3390/math8091404.
  17. Ritt, M., and Pereira, J., Heuristic and exact algorithms for minimum-weight non-spanning arborescences, European Journal of Operational Research 287, 61-75, 2020. DOI: 10.1016/j.ejor.2020.03.073.
  18. Mejía, G., and Pereira, J., Multiobjective algorithm for flexible manufacturing systems with petri nets, Journal of Manufacturing Systems 54, 272-284, 2020. DOI: 10.1016/j.jmsy.2020.01.003.
  19. Moreno, S., Pereira, J., and Yushimito, W., A hybrid k-means and integer programming method for commercial territory design: a case study in meat distribution, Annals of Operations Research 286, 87-117, 2020. DOI: 10.1007/s10479-017-2742-6.
  20. Osorio-Valenzuela, L., Pereira, J., Quezada, F. and Vásquez O.C., Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints, Applied Mathematical Modelling 74, 512-527, 2019. DOI: 10.1016/j.apm.2019.05.007.
  21. Álvarez-Miranda, E., and Pereira, J., On the complexity of assembly line balancing problems, Computers and Operations Research 108, 182-186, 2019. DOI: 10.1016/j.cor.2019.04.005.
  22. Pereira, J., Ritt, M., and Vásquez, O.C., A memetic algorithm for the cost-oriented robotic assembly line balancing problem, Computers and Operations Research 99, 249-261, 2018. DOI: 10.1016/j.cor.2019.04.005.
  23. Averbakh, I., and Pereira, J., Lateness minimization in pairwise connectivity restoration problems, INFORMS Journal on Computing 30, 522-538, 2018. DOI: 10.1287/ijoc.2017.0796.
  24. Pereira, J., The robust (minmax regret) assembly line worker assignment and balancing problem, Computers and Operations Research 93, 27-40, 2018. DOI: 10.1016/j.cor.2018.01.009.
  25. Pereira, J., Modelling and solving a cost-oriented resource-constrained multi-model assembly line balancing problem, International Journal of Production Research 56, 3994-4016, 2018. DOI: 10.1080/00207543.2018.1427899.
  26. Pereira, J., and Álvarez-Miranda, E., An exact approach for the robust assembly line balancing problem, Omega78, 85-98, 2018. DOI: 10.1016/j.omega.2017.08.020.
  27. Pereira, J., and Vásquez, O.C., The single machine weighted mean squared deviation problem, European Journal of Operational Research 261, 515-529, 2017. DOI: 10.1016/j.ejor.2017.03.001.
  28. Álvarez-Miranda, E., and Pereira, J., Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach, Computers and Operations Research 81, 178-191, 2017. DOI: 10.1016/j.cor.2016.12.018.
  29. Pereira, J. and Vilà, M, A new model for supply chain network design with integrated assembly line balancing decisions, International Journal of Production Research 54, 2653-2669, 2016. DOI: 10.1080/00207543.2015.1115910.
  30. Pereira, J., Procedures for the bin packing problem with precedence constraints, European Journal of Operational Research 250, 794-806, 2016. DOI: 10.1016/j.ejor.2015.10.048.
  31. Pereira, J., The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective, Computers and Operations Research 66, 141-152, 2016. DOI: 10.1016/j.cor.2015.08.010.
  32. Pereira, J., and Vilà, M., Variable neighborhood search heuristics for a test assembly design problem, Expert Systems with Applications 42, 4805-4817, 2015. DOI: 10.1016/j.eswa.2015.01.057.
  33. Pereira, J., and Vilà, M., An exact algorithm for the mixed-model level scheduling problem, International Journal of Production Research 53, 5809-5825, 2015. DOI: 10.1080/00207543.2015.1005771.
  34. Pereira, J., Empirical evaluation of lower bounding methods for the simple assembly line balancing problem, International Journal of Production Research 53, 3327-3340, 2015. DOI: 10.1080/00207543.2014.980014.
  35. Averbakh, I., and Pereira, J., Network construction problems with due dates, European Journal of Operational Research 244, 715-729, 2015. DOI: 10.1016/j.ejor.2015.02.014.
  36. Vilà, M., and Pereira, J., A branch-and-bound algorithm for assembly line worker assignment and balancing problems, Computers and Operations Research 44, 105-114, 2014. DOI: 10.1016/j.cor.2013.10.016.
  37. Vilà, M., and Pereira, J., An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time, European Journal of Operational Research 229, 106-113, 2013. DOI: 10.1016/j.ejor.2013.03.003.
  38. Pereira, J., and Averbakh, I., The robust set covering problem with interval data, Annals of Operations Research 207, 217-235, 2013. DOI: 10.1007/s10479-011-0876-5.
  39. Vilà, M., and Pereira, J., Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties, Computers and Operations Research 40, 1819-1828, 2013. DOI: 10.1016/j.cor.2013.01.019.
  40. Averbakh, I., and Pereira, J., The flowtime network construction problem, IIE Transactions (Institute of Industrial Engineers) 44, 681-694, 2012 10.1080/0740817X.2011.636792.
  41. Bautista, J., and Pereira, J., Procedures for the time and space constrained assembly line balancing problem, European Journal of Operational Research 212, 473-481, 2011. DOI: 10.1016/j.ejor.2011.01.052.
  42. Pereira, J., and Averbakh, I., Exact and heuristic algorithms for the interval data robust assignment problem, Computers and Operations Research 38, 1153-1163, 2011. DOI: 10.1016/j.cor.2010.11.009.
  43. Bautista, J., and Pereira, J., A dynamic programming based heuristic for the assembly line balancing problem, European Journal of Operational Research 194, 787-794, 2009. DOI: 10.1016/j.ejor.2008.01.016.
  44. Bautista, J., Fernández, E., and Pereira, J., Solving an urban waste collection problem using ants heuristics, Computers and Operations Research 35, 3020-3033, 2008. DOI: 10.1016/j.cor.2007.01.029.
  45. Bautista, J., Pereira, J., and Adenso-Díaz, B., A beam search approach for the optimization version of the car sequencing problem, Annals of Operations Research 159, 233-244, 2008. DOI: 10.1007/s10479-007-0278-x.
  46. Bautista, J., Pereira, J., and Adenso-Díaz, B., A grasp approach for the extended car sequencing problem, Journal of Scheduling 11, 3-16, 2008. 10.1007/s10951-007-0046-4.
  47. Bautista, J., and Pereira, J., A grasp algorithm to solve the unicost set covering problem, Computers and Operations Research 34, 3162-3173, 2007. DOI: 10.1016/j.cor.2005.11.026.
  48. Bautista, J., and Pereira, J., Ant algorithms for a time and space constrained assembly line balancing problem, European Journal of Operational Research 177, 2016-2032, 2007. DOI: 10.1016/j.ejor.2005.12.017.
  49. Bautista, J., and Pereira, J., Modeling the problem of locating collection areas for urban waste management. an application to the metropolitan area of barcelona, Omega 34, 617-629, 2006. DOI: 10.1016/j.omega.2005.01.013.

Others (indexed in Scopus)

  1. Pereira, J., An evolutionary and neighborhood-based algorithm for optimization under low budget requirements, GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference Companion, 17-18, 2021. DOI: 10.1145/3449726.3463282.
  2. Blum, C., and Pereira, J., Extension of the cmsa algorithm: an lp-based way for reducing sub-instances, GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference, 285-292, 2016. DOI: 10.1145/2908812.2908830.
  3. Vilà, M., and Pereira, J., A hybrid genetic algorithm for the one-dimensional minimax bin-packing problem with assignment constraints, Lecture Notes in Economics and Mathematical Systems 682, 183-188, 2016. DOI: 10.1007/978-3-319-20430-7\_23.
  4. Chica, M., Cordón, O., Damas, S., Pereira, J., and Bautista, J., Incorporating preferences to a multi-objective ant colony algorithm for time and space assembly line balancing, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5217, 331-338, 2008. DOI: 10.1007/978-3-540-87527-7\_34.
  5. Blum, C., Bautista, J., and Pereira, J., An extended beam-aco approach to the time and space constrained simple assembly line balancing problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4972, 85-96, 2008.
    6. DOI: 10.1007/978-3-540-78604-7\_8.
  6. Blum, C., Bautista, J., and Pereira, J., Beam-aco applied to assembly line balancing, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4150 LNCS, 96-107, 2006.
  7. Bautista, J., Gómez, A , Pereira, J., and Lozano, J., Comparison between metaheuristic and exact models in the packing problem resolution, Proceedings of the 2005 International Conference on Artificial Intelligence, ICAI'05 2, 435-441, 2005.
  8. Bautista, J., and Pereira, J., Ant algorithms for urban waste collection routing, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3172 LNCS, 302-309, 2004.
  9. Gomez, A., De La Fuente, D., Bautista, J., Pereira, J., and Ferrer, L., A comparative study of simulated annealing and genetic algorithms, Proceedings of the International Conference on Artificial Intelligence, IC-AI'04 1, 3-9, 2004.
  10. Bautista, J., and Pereira, J., Ant colonies for the rcps problem, Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) 2504, 257-268, 2002.
  11. Bautista, J., and Pereira, J., Ant algorithms for assembly line balancing, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2463, 65-75, 2002.
  12. Sempértegui, R., Bautista, J., Cubero, R.G., and Pereira, J., Models and procedures for electric energy distribution planning. a review, IFAC Proceedings Volumes (IFAC-PapersOnline) 15, 395-400, 2002.