Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01185216
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:22:00 PM
Last modification on : Tuesday, May 14, 2019 - 10:11:05 AM

Identifiers

Citation

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⟩

Share

Metrics

Record views

194