New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In one-machine scheduling, mixed-integer program time-indexed formulations are often used to provide very good lower bounds through Lagrangian relaxations. To get an improved lower bound, we add valid cuts to a time-indexed formulation and show we still have a Lagrangian relaxation that can be solved as a shortest path in a graph. Two branch-and-bound algorithms are then presented for the earliness-tardiness scheduling problem with either common or general due dates. In both cases, our algorithms outperform the previously published approaches.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 11:53:33 AM
Last modification on : Thursday, March 21, 2019 - 2:16:32 PM



Francis Sourd. New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2009, 21 (1), pp.167-175. ⟨10.1287/ijoc.1080.0287⟩. ⟨hal-01185191⟩



Record views