Skip to Main content Skip to Navigation
Journal articles

A new model for the preemptive earliness - tardiness scheduling problem

Nina Runge 1 Francis Sourd
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper addresses a new model for the one-machine earliness–tardiness scheduling problem where jobs can be interrupted. Some dominance rules and a lower bound are derived. A new timing algorithm is also presented and a local search algorithm based on this timing algorithm permits the computation of good feasible solutions. We experimentally compare our timing algorithm with a previously published timing algorithm. The tests show that the execution time of the new timing algorithm is significantly faster, especially for large instances. The values of the solutions are compared to the lower bound.
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 11:50:26 AM
Last modification on : Tuesday, May 14, 2019 - 10:11:05 AM



Nina Runge, Francis Sourd. A new model for the preemptive earliness - tardiness scheduling problem. Computers and Operations Research, Elsevier, 2009, 36 (7), pp.2242-2249. ⟨10.1016/j.cor.2008.08.018⟩. ⟨hal-01185190⟩



Record views