Earliness-tardiness scheduling with setup considerations

Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : The one-machine scheduling problem with sequence-dependent setup times and costs and earliness–tardiness penalties is addressed. A time-indexed formulation of the problem is presented as well as different relaxations that give lower bounds of the problem. Then, a branch-and-bound procedure based on one of these lower bounds is presented. The efficiency of this algorithm also relies on new dominance rules and on a heuristic to derive good feasible schedules. Computational tests are finally presented.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185226
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:36:03 PM
Last modification on : Thursday, November 22, 2018 - 2:07:26 PM

Identifiers

Collections

Citation

Francis Sourd. Earliness-tardiness scheduling with setup considerations. Computers and Operations Research, Elsevier, 2005, 32 (7), pp.1849-1865. 〈10.1016/j.cor.2003.12.002〉. 〈hal-01185226〉

Share

Metrics

Record views

86