Improving the preemptive bound for the single machine dynamic maximum lateness problem

Abstract : The preemptive lower bound is known to be the main available bound for the single machine dynamic maximum lateness problem. We propose an O(nlogn) time improvement to this bound which reduces by more than 80% the average the gap between the preemptive solution value and the optimal solution value.
Type de document :
Article dans une revue
Operations Research Letters, Elsevier, 2010, 38 (10), pp.589-591. 〈10.1016/j.orl.2010.08.002〉
Liste complète des métadonnées

https://hal-univ-tours.archives-ouvertes.fr/hal-01003786
Contributeur : Vincent T'Kindt <>
Soumis le : mardi 10 juin 2014 - 16:28:22
Dernière modification le : mercredi 21 mars 2018 - 10:54:09

Identifiants

Collections

Citation

Federico Della Croce, Vincent T'Kindt. Improving the preemptive bound for the single machine dynamic maximum lateness problem. Operations Research Letters, Elsevier, 2010, 38 (10), pp.589-591. 〈10.1016/j.orl.2010.08.002〉. 〈hal-01003786〉

Partager

Métriques

Consultations de la notice

57