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

Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185259
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 4:07:06 PM
Last modification on : Thursday, March 21, 2019 - 1:11:10 PM

Identifiers

Citation

Francis Sourd. Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints. Operations Research Letters, Elsevier, 2006, 34 (5), pp.591-598. 〈10.1016/j.orl.2005.06.005〉. 〈hal-01185259〉

Share

Metrics

Record views

122