En la actualidad las organizaciones est?n siendo obligadas a fomentar estructuras de operaci?n flexible y que a su vez originen reducciones de costos, los cuales se revelan en el aprovechamiento de la maquinaria, los recursos y mano de obra. En la presente investigaci?n, se introduce un problema que modela situaciones reales, el cual es de scheduling Job-shop multi-recurso con rutas lineales - JSFMRL, de este se despliegan dos sub-problemas basados en procesos de b?squeda local: asignaci?n y secuenciaci?n. El objetivo de ?sta investigaci?n es dise?ar un instrumento computacional el cual permita optimizar el Makespan en el problema de scheduling Job-shop multi-recurso con rutas lineales - JSFMRL. Este instrumento computacional se dise?? en el software MATLAB R2014a; obteniendo, un resultado positivo en la disminuci?n del mayor tiempo de finalizaci?n o tardanza total de los pedidos (Makespan), con un porcentaje promedio de rendimiento de la heur?stica del 21.1%.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%.