A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem

Abstract : 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.
Type de document :
Communication dans un congrès
THE 5th INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), Apr 2013, Hammamet, Tunisia. IEEE, 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00808361
Contributeur : Bilel Derbel <>
Soumis le : vendredi 5 avril 2013 - 11:51:40
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13

Identifiants

  • HAL Id : hal-00808361, version 1

Citation

Hiba Yahyaoui, Saoussen Krichen, Bilel Derbel, El-Ghazali Talbi. A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem. THE 5th INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), Apr 2013, Hammamet, Tunisia. IEEE, 2013. 〈hal-00808361〉

Partager

Métriques

Consultations de la notice

680