online_supplements

Online supplements

Ritt, Rossit, "Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations", Comput. Oper. Res. 2024
Code and data can be found here.

Pereira, Ritt, "Exact and heuristic methods for a workload allocation problem with chain precedence constraints", Eur. J. Oper. Res., 309, 1, 2023
Code and data can be found here.

de Souza, Ritt, López-Ibáñez, "ACVIZ: A Tool for the Visual Analysis of the Configuration of Algorithms with irace", Oper. Res. Persp., 8, 100186, 2023
The tool can be found here.

de Souza, Ritt, López-Ibáñez, "Capping strategies for the automatic configuration of optimization algorithms", Comp. Oper. Res., 139, 105615, 2022
The tool can be found here.

de Souza, Ritt, "Improved regression models for algorithm configuration", GECCO 2022
Supplementary material can be found here and here.

Gliesch, Ritt, "A new heuristic for finding verifiable k-vertex-critical subgraphs", J. Heur., 28, 2022
Code, data, and an instance generator can be found here.

Pereira, Ritt, Vásquez, "A memetic algorithm for the cost-oriented robotic assembly line balancing problem", Comput. Oper. Res. 99, 249--261, 2019
Source code and supplementary material can be found here.

Benavides, Ritt, "Fast heuristics for minimizing the makespan in non-permutation flow shops", Comput. Oper. Res., 100, 230–243, 2018
Source code and data can be found here.

Borba, Ritt, "Exact and heuristic methods for solving the robotic assembly line balancing problem", Eur. J. Oper. Res. 270(1):146-56, 2018
Supplementary material can be found here.

Zubaran, Ritt, "An effective heuristic algorithm for the partial shop scheduling problem", Comput. Oper. Res., 93, 51-65, 2018
Supplementary material can be found here.

Gliesch, Ritt, Moreira, "A genetic algorithm for fair land allocation", GECCO 2017
Supplementary material can be found here.

Silvestrin, Ritt, "An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem", Comput. Oper. Res., 81, 192-202, 2017
Supplementary material can be found here.

Ritt, Costa, Miralles, " The assembly line worker assignment and balancing problem with stochastic worker availability", Int. J. Prod. Res., 54(3), 907-922, 2016
Supplementary material can be found here.

Ritt, "A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem", 2016 IEEE International Conference on Automation Science and Engineering (CASE), Fort Worth, TX, 2016, pp. 872-877.
Supplementary material can be found here.

Benavides, Ritt, "Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops", Comput. Oper. Res., 66, 160-169, 2016
Supplementary material can be found here.

Ritt, Costa, "Improved integer programming models for simple assembly line balancing and related problems", Int. Trans. Oper. Res., 2015.
Supplementary material can be found here.

Benavides, Ritt, "Iterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops", ICAPS 2015
Supplementary material can be found here.

Benavides, Ritt, "Flow shop scheduling with heterogeneous workers". Eur. J. Oper. Res., 273(2), 713-720, 2014.
Supplementary material can be found here.

Borba, Ritt, "A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem". Comput. Oper. Res., 45:87–96, May 2014.
Supplementary material can be found here.

online_supplements.txt · Esta página foi modificada pela última vez em: 2024/07/13 11:46 (Edição externa)