Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem

Yann Hendel Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper addresses the one-machine scheduling problem where the objective is to minimize a sum of costs such as earliness–tardiness costs. Since the sequencing problem is NP-hard, local search is very useful for finding good solutions. Unlike scheduling problems with regular cost functions, the scheduling (or timing) problem is not trivial when the sequence is fixed. Therefore, the local search approaches must deal with both job interchanges in the sequence and the timing of the sequenced jobs. We present a new approach that efficiently searches in a large neighborhood and always returns a solution for which the timing is optimal.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2006, 173 (1), pp.108-119. 〈10.1016/j.ejor.2004.11.022〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185223
Contributeur : Lip6 Publications <>
Soumis le : mercredi 19 août 2015 - 14:32:06
Dernière modification le : jeudi 13 décembre 2018 - 01:27:30

Identifiants

Collections

Citation

Yann Hendel, Francis Sourd. Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. European Journal of Operational Research, Elsevier, 2006, 173 (1), pp.108-119. 〈10.1016/j.ejor.2004.11.022〉. 〈hal-01185223〉

Partager

Métriques

Consultations de la notice

65