• 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.
• 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.
• 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.

• Ritt, Costa, "Improved integer programming models for simple assembly line balancing and related problems", Int. Trans. Oper. Res., forthcoming.
  

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.