Permutation Flow Shop
Mostrando 1-3 de 3 artigos, teses e dissertações.
-
1. Heuristic for flow shop sequencing with separated and sequence independent setup times
This paper deals with the permutation flow shop scheduling problem with separated and sequence-independent machine setup times. A heuristic method with the objective of minimizing the total time to complete the schedule is introduced. The proposed heuristic is based on a structural property of this scheduling problem, which provides an upper bound on the idl
Journal of the Brazilian Society of Mechanical Sciences and Engineering. Publicado em: 2011-03
-
2. Métodos heurísticos para a programação em flow shop permutacional com tempos de setup separados dos tempos de processamento e independentes da seqüência de tarefas / Heuristic methods for the permutation flow shop scheduling problem with separated, non-batch, and sequence-independent setup times
Este trabalho dedica-se ao problema de programação em flow shop permutacional com tempos de setup separados dos tempos de processamento e independentes da seqüência de execução das tarefas com o objetivo de minimizar a duração total da programação (Makespan). Por intermédio de investigações realizadas sobre as características estruturais do pro
Publicado em: 2008
-
3. Metodologia de especificação de times assincronos para problemas de otimização combinatoria
Asynchronous Teams (A-Teams) are a new problem resolution technique that uses simultaneously various heuristic algorithms. These algorithms cooperate synergically one with the other to find optimal or nearly optimal solutions that would not be found through isolated algorithms. This technique has been successfully applied to large combinatorial problems. The
Publicado em: 1995