Skip to Main content Skip to Navigation
Journal articles

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

Federico Della Croce 1 Vincent t'Kindt 2
2 ERL CNRS 6305 Ordonnancement et Conduite
LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
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.
Document type :
Journal articles
Complete list of metadata

https://hal-univ-tours.archives-ouvertes.fr/hal-01003786
Contributor : Vincent t'Kindt Connect in order to contact the contributor
Submitted on : Tuesday, June 10, 2014 - 4:28:22 PM
Last modification on : Tuesday, January 11, 2022 - 5:56:31 PM

Identifiers

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⟩

Share

Metrics

Les métriques sont temporairement indisponibles