A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Francis Sourd 1 Safia Kedad-Sidhoum 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185214
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:19:29 PM
Last modification on : Thursday, March 21, 2019 - 2:54:26 PM

Links full text

Identifiers

Citation

Francis Sourd, Safia Kedad-Sidhoum. A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling, Springer Verlag, 2008, 11 (1), pp.49-58. ⟨10.1007/s10951-007-0048-2⟩. ⟨hal-01185214⟩

Share

Metrics

Record views

135