Flow shop scheduling with heterogeneous workers AJ Benavides, M Ritt, C Miralles European Journal of Operational Research 237 (2), 713-720, 2014 | 61 | 2014 |
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 | 49 | 2016 |
Fast heuristics for minimizing the makespan in non-permutation flow shops AJ Benavides, M Ritt Computers & Operations Research 100, 230-243, 2018 | 39 | 2018 |
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 | 29 | 2013 |
Iterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops AJ Benavides, M Ritt Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015 | 19 | 2015 |
ITSUMO: an agent-based simulator for ITS applications ALC Bazzan, MB do Amarante, T Sommer, AJ Benavides Proc. of the 4th Workshop on Artificial Transportation Systems and …, 2010 | 18 | 2010 |
A simple stochastic local search for multi-mode resource-constrained multi-project scheduling LM Borba, AJ Benavides, T Zubaran, GM Carniel, M Ritt Proceedings of the 6th Multidisciplinary International Scheduling Conference …, 2013 | 7 | 2013 |
Extending Traffic Simulation Based On Cellular Automata: From ParticlesTo Autonomous Agents. ALC Bazzan, MB do Amarante, GG Azzi, AJ Benavides, LS Buriol, ... ECMS, 91-97, 2011 | 7 | 2011 |
Service restoration and switch allocation in power distribution networks: bounds and algorithms AJ Benavides Master's thesis, Prog. Pós-graduação em Ciência da Computação, Federal …, 2010 | 6 | 2010 |
A comparison of tabu search and GRASP for the switch allocation problem AJ Benavides, MS Machado, AM Costa, M Ritt, LS Buriol, VJ Garcia, ... XLI Simpósio Brasileiro de Pesquisa Operacional (SBPO), Sociedade Brasileira …, 2009 | 6 | 2009 |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem AJ Benavides, A Vera European Journal of Operational Research 297 (2), 407-421, 2022 | 4 | 2022 |
A New Tiebreaker in the NEH heuristic for the Permutation Flow Shop Scheduling Problem AJ Benavides EasyChair Preprint 440, 2018 | 4 | 2018 |
Models for the inclusion of workers with disabilities in flow shop scheduling problems GC Carniel, AJ Benavides, M Ritt Simpósio Brasileiro de Pesquisa Operacional, 3320-3329, 2013 | 4 | 2013 |
Including workers with disabilities in flow shop scheduling GC Carniel, AJ Benavides, M Ritt, C Miralles Automation Science and Engineering (CASE), 2015 IEEE International …, 2015 | 2 | 2015 |
The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan M Ritt, AJ Benavides Proceedings of the Genetic and Evolutionary Computation Conference, 270-277, 2021 | | 2021 |
An Iterated Semi-Greedy Algorithm for the 0-1 Quadratic Knapsack Problem LLP Alva, AJ Benavides EasyChair, 2018 | | 2018 |
Heuristics for flow shop scheduling : considering non-permutation schedules and a heterogeneous workforce AJ Benavides Rojas http://www.lume.ufrgs.br/handle/10183/131868, 2015 | | 2015 |
Heuristics for heterogeneous shop scheduling in sheltered work centers for disabled AJ Benavides, M Ritt, CM Insa XXXIV Congreso Nacional de Estadística e Investigación Operativa, VIII …, 2013 | | 2013 |
Service restoration and switch allocation in power distribution networks: bounds and algorithms AJ Benavides Rojas | | 2010 |
Sample Algorithms in Multi-start Heuristics for the Switch Allocation Problem AJ Benavides, M Ritt, LS Buriol | | |