Article Dans Une Revue European Journal of Operations Research Année : 2005

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.

Fichier principal
Vignette du fichier
ab1.pdf (145.5 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-00341340 , version 1 (19-07-2009)

Licence

Identifiants

  • HAL Id : hal-00341340 , version 1

Citer

Eric Angel, Evripidis Bampis. A multi-start Dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. European Journal of Operations Research, 2005, 162 (1), pp.281--289. ⟨hal-00341340⟩
232 Consultations
260 Téléchargements

Partager

  • More