A multi-start Dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
Résumé
We extend the dynasearch technique, recently proposed by Congram et al., in the context of time-dependent combinatorial optimization problems. As an application we consider a general time-dependent (idleness) version of the well known single-machine total weighted tardiness scheduling problem, in which the processing time of a job depends on its starting time of execution. We develop a multi-start local search algorithm and present experimental results on several types of instances showing the superiority of the dynasearch neighborhood over the traditional one.
Origine : Fichiers produits par l'(les) auteur(s)