Comparative Study Between The Wolf Search Algorithm And Other Metaheuristics For The Scheduling Single Machine Problem With Sequence- Dependent Setup Times

Estudio Comparativo Entre El Algoritmo Búsqueda De Lobos Y Otras Metaheurísticas En El Problema De Una Máquina Con Tiempos De Alistamiento Dependientes De La Secuencia

In this article, the Wolf Search algorithm was adapted to solve the problem a single machine with sequence-dependent setup times. To represent the solution of the problem, a permuted discrete coding scheme was proposed. The performance of the algorithm was compared with the Metaheuristic Viral System and Simulated Annealing in 35 instances with sizes between 15 and 150 jobs. From a Variance Analysis, it was found that the Wolf Search and Viral System algorithms are similar in their performance in terms of response quality, however, the Wolf Search algorithm has a low computational time compared to the Viral System algorithm. It is concluded that the Wolf Search algorithm can be used with great certainty to address the problem of production programming on a single machine with sequence-dependent enlistment times, for which it is proposed that it be used in other programming problems of combinatorial production or optimization.