Extending Traffic Simulation Based On Cellular Automata: From ParticlesTo Autonomous Agents. - Ana L. C. Bazzan; Maicon de Brito do Amarante; Guilherme G. Azzi; Alexander J. Benavides; Luciana S. Buriol; Leonardo F. S. Moura; Marcus Ritt; Tiago Sommer (ECMS, 2011)

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks. - Alexander J. Benavides; Marcus Ritt; Luciana S. Buriol; Paulo Morelato França (Comput. Oper. Res., 2013)

Flow shop scheduling with heterogeneous workers. - Alexander J. Benavides; Marcus Ritt; Cristóbal Miralles (Eur. J. Oper. Res., 2014)

Iterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops. - Alexander Javier Benavides; Marcus Ritt (ICAPS, 2015)

Including workers with disabilities in flow shop scheduling. - Germano C. Carniel; Alexander J. Benavides; Marcus Ritt; Cristóbal Miralles (CASE, 2015)

Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops. - Alexander J. Benavides; Marcus Ritt (Comput. Oper. Res., 2016)

Fast heuristics for minimizing the makespan in non-permutation flow shops. - Alexander J. Benavides; Marcus Ritt (Comput. Oper. Res., 2018)

The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan. - Marcus Ritt; Alexander J. Benavides (GECCO, 2021)

The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem. - Alexander J. Benavides; Antony Vera (Eur. J. Oper. Res., 2022)