A Constructive Heuristic for Solving the Job-Shop Scheduling Problem

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.