A Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine Problem

Ricardo P. Beausoleil
2011 Revista de Matemática: Teoría y Aplicaciones  
In this paper, a Tabu Search Approach for the weighted tardiness single machine problem with sequence-dependent setups is proposed. The main contribution is the balance obtained between intensification and diversification strategies. The strategy of combine large step optimization, frequency-based memory, intensification by decomposition supplementing this with an additional intensification using path relinking produce good solutions with a low computational cost. Our Tabu Search approach is
more » ... arch approach is compared with a re-start method that employs the all-pairs neighborhood. Results of computational experiments are reported for a set of randomly generated test problems. Palabras clave: Búsqueda Tabú, problemas de calendarización, retardo ponderado, puestas a punto que dependen de la sucesión. Mathematics Subject Classification: 90C27
doi:10.15517/rmta.v9i1.208 fatcat:mu7gwwei2vbvtkebytv7ucgdiq