Una heurística constructiva para la resolución del problema de Job-Shop Scheduling
(A constructive heuristic for solving the Job-Shop Scheduling Problem)
Rafael Mellado Silva (email@example.com)1, Claudio Cubillos (firstname.lastname@example.org)1, Daniel Cabrera Paniagua (email@example.com)2
1Pontificia Universidad Catolica de Valparaiso2Universidad de Valparaíso
This paper appears in: Revista IEEE América Latina
Publication Date: June 2016
Volume: 14, Issue: 6
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.
Job Shop Scheduling, constructive heuristic, tabu search
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (369)]