Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

https://hal.inria.fr/hal-00808361
Contributor : Bilel Derbel <>
Submitted on : Friday, April 5, 2013 - 11:51:40 AM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM

Identifiers

  • 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. ⟨hal-00808361⟩

Share

Metrics

Record views

805