A carregar...
Publicação
Using tabu search for dynamic scheduling: the extended job-shop scheduling problem
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 2.15 MB | Adobe PDF |
Orientador(es)
Resumo(s)
In most practical environments, scheduling is an ongoing reactive process where the presence of real time information continually forces reconsideration and revision of pre-established schedules. Scheduling algorithms that achieve good or near optimal solutions and can efficiently adapt them to perturbations are, in most cases, preferable to those that achieve optimal ones but that cannot implement such an adaptation. This reality, motivated us to concentrate on tools, which could deal with such dynamic, disturbed scheduling problems, both for single and multi-machine manufacturing settings, even though, due to the complexity of these problems, optimal solutions may not be possible to find. We decided to address the problem drawing upon the potential of Tabu Search to deal with such complex situations.
Descrição
Palavras-chave
Dynamic scheduling Rescheduling Tabu search Dynamic adaptation
Contexto Educativo
Citação
Madureira, A., Ramos, C. & Silva, S. C. (2003, August 13-16). Using tabu search for dynamic scheduling: the extended job-shop scheduling problem. In Kendall, G., Burke, E. & Petrovic, S. (Eds.) MISTA 2003: Proceedings of the 1st Multidisciplinary International Conference on Scheduling: theory and applications (Vol. 1).(pp.114-115). University of Nottingham, UK
Editora
The University of Nottingham
Licença CC
Sem licença CC