| Author |
Title |
Year |
Publication |
Volume |
Pages  |
| Alvarez-Miranda, E.; Pereira, J.; Vargas, C.; Vila, M. |
Variable-depth local search heuristic for assembly line balancing problems |
2022 |
International Journal Of Production Research |
Early Access |
|
| Alvarez-Miranda, E.; Pereira, J. |
A Districting Application with a Quality of Service Objective |
2022 |
Mathematics |
10 |
13 |
| Pereira, J. |
The robust (minmax regret) assembly line worker assignment and balancing problem |
2018 |
Computers & Operations Research |
93 |
27-40 |
| Alvarez-Miranda, E.; Campos-Valdes, C.; Quiroga, M.M.; Moreno-Faguett, M.; Pereira, J. |
A Multi-Criteria Pen for Drawing Fair Districts: When Democratic and Demographic Fairness Matter |
2020 |
Mathematics |
8 |
27 pp |
| Ritt, M.; Pereira, J. |
Heuristic and exact algorithms for minimum-weight non-spanning arborescences |
2020 |
European Journal Of Operational Research |
287 |
61-75 |
| Pereira, J.; Alvarez-Miranda, E. |
An exact approach for the robust assembly line balancing problem |
2018 |
Omega-International Journal Of Management Science |
78 |
85-98 |
| Moreno, S.; Pereira, J.; Yushimito, W. |
A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution |
2020 |
Annals Of Operations Research |
286 |
87-117 |
| Pereira, J. |
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective |
2016 |
Computers & Operations Research |
66 |
141-152 |
| Alvarez-Miranda, E.; Pereira, J. |
Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach |
2017 |
Computers & Operations Research |
81 |
178-191 |
| Alvarez-Miranda, E.; Pereira, J. |
On the complexity of assembly line balancing problems |
2019 |
Computers & Operations Research |
108 |
182-186 |
| Pereira, J.; Ritt, M.; Vasquez, O.C. |
A memetic algorithm for the cost-oriented robotic assembly line balancing problem |
2018 |
Computers & Operations Research |
99 |
249-261 |
| Mejia, G.; Pereira, J. |
Multiobjective scheduling algorithm for flexible manufacturing systems with Petri nets |
2020 |
Journal Of Manufacturing Systems |
54 |
272-284 |
| Yuraszeck, F.; Mejia, G.; Pereira, J.; Vila, M. |
A Novel Constraint Programming Decomposition Approach for the Total Flow Time Fixed Group Shop Scheduling Problem |
2022 |
Mathematics |
10 |
329 |
| Osorio-Valenzuela, L.; Pereira, J.; Quezada, F.; Vasquez, O.C. |
Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints |
2019 |
Applied Mathematical Modelling |
74 |
512-527 |
| Pereira, J.; Vasquez, O.C. |
The single machine weighted mean squared deviation problem |
2017 |
European Journal Of Operational Research |
261 |
515-529 |
| Averbakh, I.; Pereira, J. |
Lateness Minimization in Pairwise Connectivity Restoration Problems |
2018 |
Informs Journal On Computing |
30 |
522-538 |
| Pereira, J. |
Procedures for the bin packing problem with precedence constraints |
2016 |
European Journal Of Operational Research |
250 |
794-806 |
| Campos-Valdes, C.; Alvarez-Miranda, E.; Quiroga, MM; Pereira, J.; Duran, FL. |
The Impact of Candidates' Profile and Campaign Decisions in Electoral Results: A Data Analytics Approach |
2021 |
Mathematics |
9 |
902 |
| Cohen, Y.M.; Keskinocak, P.; Pereira, J. |
A note on the flowtime network restoration problem |
2021 |
IISE Transactions |
53 |
1351-1352 |
| Pereira, J.; Ritt, M |
A note on “Algorithms for the Calzedonia workload allocation problem” |
2022 |
Journal of the Operational Research Society |
73 |
1420-1422 |
