Improving the preemptive bound for the single machine dynamic maximum lateness problem - Université de Tours Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2010

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

Federico Della Croce
  • Fonction : Auteur
  • PersonId : 946989
Vincent t'Kindt

Résumé

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.

Dates et versions

hal-01003786 , version 1 (10-06-2014)

Identifiants

Citer

Federico Della Croce, Vincent t'Kindt. Improving the preemptive bound for the single machine dynamic maximum lateness problem. Operations Research Letters, 2010, 38 (10), pp.589-591. ⟨10.1016/j.orl.2010.08.002⟩. ⟨hal-01003786⟩
28 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More