A constructive heuristic for solving the Job-Shop Scheduling Problem

Rafael Mellado Silva, CLAUDIO ALONSO CUBILLOS FIGUEROA, Daniel Cabrera Paniagua

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

5 Citas (Scopus)

Resumen

This work proposes the use of a constructive heuristic called Shifting Bottleneck Procedure for solving the Job-Shop Scheduling problem, with the aim to minimize the makespan, that is, the final delay of production planning. Because the constructive heuristic delivers an initial solution, then a Tabu Search method was used, with the aim to obtain a planification with the lowest possible makespan. The proposal was tested using benchmark data, and the results are promising, because the obtention of initial solutions using a constructive heuristic allows to decrease the processing time, and usually, the final results obtained from Tabu Search method are better.

Idioma originalInglés
Número de artículo7555250
Páginas (desde-hasta)2758-2763
Número de páginas6
PublicaciónIEEE Latin America Transactions
Volumen14
N.º6
DOI
EstadoPublicada - jun 2016
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'A constructive heuristic for solving the Job-Shop Scheduling Problem'. En conjunto forman una huella única.

Citar esto