Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2006

Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints

Francis Sourd
  • Fonction : Auteur
  • PersonId : 836436

Résumé

A large dynasearch neighborhood is introduced for the one-machine scheduling problem with sequence-dependent setup times and costs and earliness–tardiness penalties. Finding the best schedule in this neighborhood is NP-complete in the ordinary sense but can be done in pseudo-polynomial time. We also present experimental results.

Dates et versions

hal-01185259 , version 1 (19-08-2015)

Identifiants

Citer

Francis Sourd. Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints. Operations Research Letters, 2006, 34 (5), pp.591-598. ⟨10.1016/j.orl.2005.06.005⟩. ⟨hal-01185259⟩
79 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More