| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 1.07 MB | Adobe PDF |
Orientador(es)
Resumo(s)
[Abstract exerpt] In recent years, there have been significant advances in the theory and the application of Meta-Heuristics to solve hard optimization problems. Most of the heuristic or approximation methods proposed for Job-
Shop Scheduling problems are tailored techniques, i.e. developed specifically for a problem in consideration. There is a need to develop robust and flexible methods capable of being applicable not only to a specific problem and environment but also to a variety of scheduling problems and environments.
Descrição
Palavras-chave
Contexto Educativo
Citação
Madureira, A., Ramos, C. & Silva, S. C. (2003, August 25-28). Vertical scheduling approach to dynamic scheduling problems using Tabu search [Abstract]. MIC 2003 – The Fifth Metaheuristics International Conference, Kyoto, Japan.
Editora
The Kyoto University Foundation
Licença CC
Sem licença CC
