Buscar
Itens para a visualização no momento 1-2 of 2
Problema de recobrimento de conjuntos com agrupamento: modelos e algoritmos
(Universidade Federal de Santa Maria, 2015-04-14)
This work addresses the clustered set covering problem, a variant of the classic set
covering problem in which sets are arranged in K disjoint clusters. Two practical applications
found in the literature are presented. ...
Implementação e teste de uma heurística de descida em vizinhança variável para um problema de programação de tarefas em máquinas paralelas
(Universidade Federal de Santa Maria, 2013-02-21)
In this work is presented a study on the unrelated parallel machine task scheduling
with machine and sequence dependent setup times problem. This problem is of practical
interest and occurs, for instance, in large ...