An improved earliness-tardiness timing algorithm

Yann Hendel Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2007, 34 (10), pp.2931-2938. 〈10.1016/j.cor.2005.11.004〉
Liste complète des métadonnées
Contributeur : Lip6 Publications <>
Soumis le : mercredi 19 août 2015 - 14:22:00
Dernière modification le : jeudi 22 novembre 2018 - 14:07:26




Yann Hendel, Francis Sourd. An improved earliness-tardiness timing algorithm. Computers and Operations Research, Elsevier, 2007, 34 (10), pp.2931-2938. 〈10.1016/j.cor.2005.11.004〉. 〈hal-01185216〉



Consultations de la notice