• An efficient heuristic for the multi-compartment vehicle routing problem 

      Silvestrin, Paulo Vitor (2016) [Dissertação]
      We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different ...
    • A study onshop sceduling problems 

      Zubaran, Tadeu Knewitz (2018) [Tese]
      Shop scheduling is a combinatorial optimization type of problem in which we must allocate machines to jobs for specific periods time. A set of constraints defines which schedules are valid, and we must select one that ...