A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem
Résumé
A Variable Neighborhood Descent (VND) approach is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategies are proposed to select iteratively the accurate neighborhood. Our approach was compared to standard VND variants through several experiments assessing the performance of our approach. In particular, we show that improvement can be obtained on many SMTWTP instances.