An improved earliness-tardiness timing algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2007

An improved earliness-tardiness timing algorithm

Yann Hendel
  • Fonction : Auteur
Francis Sourd
  • Fonction : Auteur
  • PersonId : 836436

Résumé

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 et versions

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

Identifiants

Citer

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 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More