Flowshop de permutação variante total Flowtime: Um estudo algorítmico
This document presents three meta-heuristics approach, GRASP, VNS and particle swarm optimization (PSO) to minimize the total flowtime criterion in flowshop scheduling. The proposed algorithms were compared with the state-of-the-art methods on 129 instances. The results of the experiments point out...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | bachelorThesis |
| Idioma: | pt_BR |
| Publicado em: |
Universidade Federal do Rio Grande do Norte
|
| Assuntos: | |
| Endereço do item: | https://repositorio.ufrn.br/handle/123456789/47597 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
| Resumo: | This document presents three meta-heuristics approach, GRASP, VNS and particle swarm optimization (PSO) to minimize the total flowtime criterion in flowshop scheduling. The proposed algorithms were compared with the state-of-the-art methods on 129 instances. The results of the experiments point out that the performance of state-of-the-art methods degenerates on large instances, the proposed methods don’t present the same performance. The statistical analysis of the results indicates that the proposed approaches significantly outperform the other tested algorithms. |
|---|