关注
Marcus Ritt
Marcus Ritt
Universidade Federal do Rio Grande do Sul
在 ritt-online.de 的电子邮件经过验证
标题
引用次数
引用次数
年份
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
1342014
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
1162012
An iterated tabu search for the multi-compartment vehicle routing problem
PV Silvestrin, M Ritt
Computers & Operations Research 81, 192-202, 2017
1152017
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
742018
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
702017
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
662018
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
652016
Flow shop scheduling with heterogeneous workers
AJ Benavides, M Ritt, C Miralles
European Journal of Operational Research 237 (2), 713-720, 2014
602014
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
572010
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
472016
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
442018
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
412011
Fast heuristics for minimizing the makespan in non-permutation flow shops
AJ Benavides, M Ritt
Computers & Operations Research 100, 230-243, 2018
372018
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
292020
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
292013
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
272000
Simulated annealing for the machine reassignment problem
GM Portal, M Ritt, LM Borba, LS Buriol
Annals of Operations Research 242 (1), 93-114, 2016
222016
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
202022
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
202013
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
192015
系统目前无法执行此操作,请稍后再试。
文章 1–20