| Revue: | Polibits |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000402948 |
| ISSN: | 1870-9044 |
| Autores: | Nouri, Nouha1 Ladhari, Talel1 |
| Instituciones: | 1Universite de Tunis, Ecole Superieure des Sciences Economiques et Commerciales de Tunis, Túnez. Túnez |
| Año: | 2016 |
| Periodo: | Ene-Jun |
| Número: | 53 |
| Paginación: | 91-95 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Analítico |
| Resumen en inglés | We propose in this paper a Blocking Iterated Greedy algorithm (BIG) which makes an adjustment between two relevant destruction and construction stages to solve the blocking flow shop scheduling problem and minimize the maximum completion time (makespan). The greedy algorithm starts from an initial solution generated based on some well-known heuristic. Then, solutions are enhanced till some stopping condition and through the above mentioned stages. The effectiveness and efficiency of the proposed technique are deduced from all the experimental results obtained on both small randomly generated instances and on Taillard’s benchmark in comparison with state-of-the-art methods |
| Disciplinas: | Ciencias de la computación, Matemáticas |
| Palabras clave: | Inteligencia artificial, Matemáticas aplicadas, Investigación de operaciones, Planificación, Algoritmos voraces, Optimización |
| Keyword: | Computer science, Mathematics, Artificial intelligence, Applied mathematics, Operations research, Scheduling, Greedy algorithms, Optimization |
| Texte intégral: | Texto completo (Ver PDF) |
