| A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem L Borba, M Ritt Computers & Operations Research 45, 87-96, 2014 | 141 | 2014 |
| Simple heuristics for the assembly line worker assignment and balancing problem MCO Moreira, M Ritt, AM Costa, AA Chaves Journal of heuristics 18, 505-524, 2012 | 127 | 2012 |
| An iterated tabu search for the multi-compartment vehicle routing problem PV Silvestrin, M Ritt Computers & Operations Research 81, 192-202, 2017 | 122 | 2017 |
| Exact and heuristic methods for solving the robotic assembly line balancing problem L Borba, M Ritt, C Miralles European Journal of Operational Research 270 (1), 146-156, 2018 | 76 | 2018 |
| On the minimization of traffic congestion in road networks with tolls F Stefanello, LS Buriol, MJ Hirsch, PM Pardalos, T Querido, ... Annals of Operations Research 249, 119-139, 2017 | 75 | 2017 |
| A memetic algorithm for the cost-oriented robotic assembly line balancing problem J Pereira, M Ritt, ÓC Vásquez Computers & Operations Research 99, 249-261, 2018 | 70 | 2018 |
| The assembly line worker assignment and balancing problem with stochastic worker availability M Ritt, AM Costa, C Miralles International Journal of Production Research 54 (3), 907-922, 2016 | 69 | 2016 |
| Flow shop scheduling with heterogeneous workers AJ Benavides, M Ritt, C Miralles European Journal of Operational Research 237 (2), 713-720, 2014 | 63 | 2014 |
| A biased random-key genetic algorithm for road congestion minimization LS Buriol, MJ Hirsch, PM Pardalos, T Querido, MGC Resende, M Ritt Optimization Letters 4, 619-633, 2010 | 57 | 2010 |
| Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops AJ Benavides, M Ritt Computers & Operations Research 66, 160-169, 2016 | 50 | 2016 |
| Improved integer programming models for simple assembly line balancing and related problems M Ritt, AM Costa International Transactions in Operational Research 25 (4), 1345-1359, 2018 | 47 | 2018 |
| A biased random‐key genetic algorithm for OSPF and DEFT routing to minimize network congestion R Reis, M Ritt, LS Buriol, MGC Resende International Transactions in Operational Research 18 (3), 401-423, 2011 | 42 | 2011 |
| Fast heuristics for minimizing the makespan in non-permutation flow shops AJ Benavides, M Ritt Computers & Operations Research 100, 230-243, 2018 | 40 | 2018 |
| A runtime and non-intrusive approach to optimize edp by tuning threads and cpu frequency for openmp applications J Schwarzrock, CC de Oliveira, M Ritt, AF Lorenzon, ACS Beck IEEE Transactions on Parallel and Distributed Systems 32 (7), 1713-1724, 2020 | 31 | 2020 |
| An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks AJ Benavides, M Ritt, LS Buriol, PM França Computers & operations research 40 (1), 24-32, 2013 | 30 | 2013 |
| TPO++: An object-oriented message-passing library in C++ T Grundmann, M Ritt, W Rosenstiel Proceedings 2000 International Conference on Parallel Processing, 43-50, 2000 | 26 | 2000 |
| Simulated annealing for the machine reassignment problem GM Portal, M Ritt, LM Borba, LS Buriol Annals of Operations Research 242 (1), 93-114, 2016 | 25 | 2016 |
| Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization A Brum, R Ruiz, M Ritt Computers & Industrial Engineering 163, 107843, 2022 | 24 | 2022 |
| Iterated local search heuristics for minimizing total completion time in permutation and non-permutation flow shops A Benavides, M Ritt Proceedings of the International Conference on Automated Planning and …, 2015 | 19 | 2015 |
| Finding optimal solutions to Sokoban using instance dependent pattern databases A Pereira, M Ritt, L Buriol Proceedings of the International Symposium on Combinatorial Search 4 (1 …, 2013 | 19 | 2013 |
Luciana Salete BuriolComputer Science, UFRGS and Amazonamazon.com의 이메일 확인됨