Improving the preemptive bound for the single machine dynamic maximum lateness problem - Archive ouverte HAL Access content directly
Journal Articles Operations Research Letters Year : 2010

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

(1) , (2)
1
2
Federico Della Croce
  • Function : Author
  • PersonId : 946989

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.
Not file

Dates and versions

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

Identifiers

Cite

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 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More