Large neighborhood for a parallel scheduling problem with earliness-tardiness penalties and a common due date - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Large neighborhood for a parallel scheduling problem with earliness-tardiness penalties and a common due date

Yasmin Agueda Rios Solis
  • Fonction : Auteur
  • PersonId : 996807
Francis Sourd
  • Fonction : Auteur
  • PersonId : 836436

Résumé

This paper addresses the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a common due date. Since the problem is conjectured NP-hard in the strong sense, we propose a large neighborhood search that can be explored by a pseudo polynomial dynamic program algorithm. Computational experiments are presented and compared to a lower bound in order to verify that their gap is reasonable. They are also compared to simple local search based on moves and swaps between jobs.
Fichier non déposé

Dates et versions

hal-01420609 , version 1 (20-12-2016)

Identifiants

  • HAL Id : hal-01420609 , version 1

Citer

Yasmin Agueda Rios Solis, Francis Sourd. Large neighborhood for a parallel scheduling problem with earliness-tardiness penalties and a common due date. Multidisciplinary International Conference on Scheduling: Theory and Applications, Jul 2005, New York, United States. pp.169-184. ⟨hal-01420609⟩
49 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More