An improved earliness-tardiness timing algorithm - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2007

An improved earliness-tardiness timing algorithm

Yann Hendel
  • Function : Author
Francis Sourd
  • Function : Author
  • PersonId : 836436


Earliness–tardiness criteria with distinct due dates usually induce NP-complete problems. Researchers have focused on particular cases like the timing problem, which is to look for the optimal schedule when the jobs sequence is already known. These timing algorithms are very useful since they can be used in more complex procedures. In the first part of this paper we provide the most efficient and fairly general algorithm to solve the one-machine timing problem. It is then adapted to a permutation flow shop problem.

Dates and versions

hal-01185216 , version 1 (19-08-2015)



Yann Hendel, Francis Sourd. An improved earliness-tardiness timing algorithm. Computers and Operations Research, 2007, 34 (10), pp.2931-2938. ⟨10.1016/j.cor.2005.11.004⟩. ⟨hal-01185216⟩
119 View
0 Download



Gmail Facebook X LinkedIn More