Diferenças

Esta página mostra as diferenças entre as duas revisões da página.

--- online_supplements [2019/08/23 17:24]
marcus
+++ online_supplements [2024/07/13 11:46] (Actual)
@@ Linha 1: / Linha 1: @@
 ====== Online supplements ======
-  * [[https://doi.org/10.1016/j.cor.2018.07.017|Benavides, Ritt, "Fast heuristics for minimizing the makespan in non-permutation flow shops", Comp. Oper. Res., 100, 230–243, 2018]]\\ Supplementary material can be found [[http://inf.ufrgs.br/algopt/npfs2|here]].
-  * [[https://doi.org/10.1016/j.ejor.2018.03.011|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 [[http://inf.ufrgs.br/algopt/rablp1|here]].
+  * [[https://doi.org/10.1016/j.cor.2024.106742|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 [[https://github.com/mrpritt/npfs-mo|here]].
+  * [[https://doi.org/10.1016/j.ejor.2022.12.035|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 [[https://github.com/jordipereiragude/workload_allocation_chains|here]].
+  * [[https://doi.org/10.1016/j.orp.2021.100186|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  [[https://github.com/souzamarcelo/acviz|here]].
+  * [[https://doi.org/10.1016/j.cor.2021.105615|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  [[https://github.com/souzamarcelo/capopt|here]].
-  * [[https://doi.org/10.1016/j.cor.2018.01.015|Zubaran, Ritt, "An effective heuristic algorithm for the partial shop scheduling problem", Comp. Oper. Res., 93, 51-65, 2018]]\\ Supplementary material can be found [[http://inf.ufrgs.br/algopt/pssp|here]].
+  * [[https://doi.org/10.1145/3512290.3528750|de Souza, Ritt, "Improved regression models for algorithm configuration", GECCO 2022]]\\ Supplementary material can be found [[https://github.com/souzamarcelo/regression-models-ac|here]] and [[https://github.com/souzamarcelo/supp-models-ac|here]].
-  * [[http://dx.doi.org/10.1145/3071178.3071313|Gliesch, Ritt Moreira, "A genetic algorithm for fair land allocation", GECCO 2017]]\\ Supplementary material can be found [[http://inf.ufrgs.br/algopt/proterra|here]].
+  * [[http://dx.doi.org/10.1007/s10732-021-09487-9|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 [[https://github.com/AlexGliesch/critical-coloring|here]].
-  * [[http://dx.doi.org/10.1016/j.cor.2016.12.023|Silvestrin, Ritt, "An Iterated Tabu Search for the Multi-compartment Vehicle Routing Problem", Comp. Oper. Res., 81, 192-202, 2017]]\\ Supplementary material can be found [[http://inf.ufrgs.br/algopt/MCVRP|here]].
+  * [[https://doi.org/10.1016/j.cor.2018.07.001|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 [[https://github.com/AlexGliesch/critical-coloring|here]].
+  * [[https://doi.org/10.1016/j.cor.2018.07.017|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 [[https://github.com/mrpritt/npfs3|here]].
-  * [[http://dx.doi.org/10.1080/00207543.2015.1108534|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 [[http://www.inf.ufrgs.br/algopt/salwabp|here]].
+  * [[https://doi.org/10.1016/j.ejor.2018.03.011|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 [[https://github.com/mrpritt/RoboticALBP|here]].
-  * [[https://doi.org/10.1109/COASE.2016.7743493|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 [[http://inf.ufrgs.br/algopt/pfssp-cbfs|here]].
+  * [[https://doi.org/10.1016/j.cor.2018.01.015|Zubaran, Ritt, "An effective heuristic algorithm for the partial shop scheduling problem", Comput. Oper. Res., 93, 51-65, 2018]]\\ Supplementary material can be found [[https://github.com/mrpritt/pssp|here]].
-  * [[http://dx.doi.org/10.1016/j.cor.2015.08.001|Benavides, Ritt, "Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops", Comp. Oper. Res., 66, 160-169, 2016]]\\ Supplementary material can be found [[http://inf.ufrgs.br/algopt/npfs|here]].
+  * [[http://dx.doi.org/10.1145/3071178.3071313|Gliesch, Ritt, Moreira, "A genetic algorithm for fair land allocation", GECCO 2017]]\\ Supplementary material can be found [[https://github.com/mrpritt/fairlandallocation|here]].
-  * [[http://dx.doi.org/10.1111/itor.12206|Ritt, Costa, "Improved integer programming models for simple assembly line balancing and related problems", Int. Trans. Oper. Res., 2015.]]\\ Supplementary material can be found [[http://www.inf.ufrgs.br/algopt/albp|here]].
+  * [[http://dx.doi.org/10.1016/j.cor.2016.12.023|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 [[https://github.com/mrpritt/MC-VRP|here]].
-  * [[https://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10545|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 [[npcsum|here]].
+  * [[http://dx.doi.org/10.1080/00207543.2015.1108534|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 [[https://github.com/mrpritt/SALWABP|here]].
-  * [[http://dx.doi.org/10.1016/j.ejor.2014.02.012|Benavides, Ritt, "Flow shop scheduling with heterogeneous workers". Eur. J. Oper. Res., 273(2), 713-720, 2014.]]\\ Supplementary material can be found [[http://inf.ufrgs.br/algopt/hetFS|here]].
+  * [[https://doi.org/10.1109/COASE.2016.7743493|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 [[https://github.com/mrpritt/pfs-cbfs|here]].
-  * [[http://dx.doi.org/10.1016/j.cor.2013.12.002|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 [[http://inf.ufrgs.br/algopt/alwabp2|here]].
+  * [[http://dx.doi.org/10.1016/j.cor.2015.08.001|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 [[https://github.com/mrpritt/npfs2|here]].
-<html>
+  * [[http://dx.doi.org/10.1111/itor.12206|Ritt, Costa, "Improved integer programming models for simple assembly line balancing and related problems", Int. Trans. Oper. Res., 2015.]]\\ Supplementary material can be found [[https://github.com/mrpritt/salbp-models|here]].
-<!--- [[http://alwabp2.herokuapp.com/instances|here]] -->
-</html>
+  * [[https://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10545|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 [[https://github.com/mrpritt/NPFS-Csum|here]].
+  * [[http://dx.doi.org/10.1016/j.ejor.2014.02.012|Benavides, Ritt, "Flow shop scheduling with heterogeneous workers". Eur. J. Oper. Res., 273(2), 713-720, 2014.]]\\ Supplementary material can be found [[https://github.com/mrpritt/hetFS|here]].
+  * [[http://dx.doi.org/10.1016/j.cor.2013.12.002|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 [[https://github.com/mrpritt/ALWABP|here]].
 <html>

Marcus Ritt

Ferramentas de Utilizador

Ferramentas de Site

Diferenças

Ferramentas de Página