Job Shop Scheduling Problem (JSP), classified as NP-Hard, has been a challenge for the scientific community because achieving an optimal solution to this problem is complicated as it grows in number of machines and jobs. Numerous techniques, including metaheuristics, have been used for its solution; however, the efficiency of * Ingeniero Industrial, Universidad de Ibague; Magister en Ingenieria Industrial, Universidad de los Andes. Docente e Investigador, Grupo de Investigacion GINNOVA, Universidad de Ibague. Ibague, Colombia. Jose.meisel@unibague.edu.co ** Ingeniera Industrial, Universidad de Ibague. Ibague, Colombia. liloprado@hotmail.com