Resumen

At present, organizations are being forced to promote structures of flexible operation that in turn cause cost reductions, which are revealed in the use of machinery, resources and labor. In this research, we introduce a problem that models real situations, which is scheduling Job-shop multi-resource with linear routes - JSFMRL, from these two sub-problems are based on local search processes: allocation and sequencing. The objective of this research is to design a computational instrument which allows to optimize the Makespan in the scheduling problem Job-shop multi-resource with linear routes - JSFMRL. This computational instrument was designed in MATLAB R2014a software; obtaining, a positive result in the decrease of the greater time of finalization or total delay of the orders (Makespan), with an average percentage of performance of the heuristic of 21.1%.