Navegação por Assunto "Iterated Greedy"
Resultados 1-1 de 1
-
A study onshop sceduling problems
(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 ...