ESTRATEGIAS MMAS PARA MINIMIZACIÓN DEL MAKESPA EN LA PROGRAMACIÓN DE UNA MÁQUINA CON SETUP.

This paper studied an ant colony optimization algorithm with upper and lower pheromone limits called the Max-Min Ant System is applied to solve the single machine scheduling problem with sequence dependent setup times and makespan minimization. The study presents and compares three variants of the algorithm based on the pheromone update applied to a set of problems of size 100 jobs. The algorithms variants are compared between them and with a constructive greedy heuristic of the best neighbor. We conclude that adequate modifications to the pheromone actualization strategy improve significantly the solution quality, obtaining solution near the optimum due to the average differences less than 1% with respect to a lower bound of the makespan. [ABSTRACT FROM AUTHOR]