A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates

Philippe Baptiste (1) , Jacques Carlier (1) , Antoine Jouglet (1)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]

In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. We introduce new lower bounds and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. Computational results show that the proposed approach outperforms the best known procedures.

Mots clés: Scheduling; Single Machine; Total Tardiness

Domaines: Recherche opérationnelle [math.OC]

Philippe Baptiste, Jacques Carlier, Antoine Jouglet. A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates. European Journal of Operational Research, 2004, 158 (3), pp.595-608. ⟨10.1016/S0377-2217(03)00378-3⟩. ⟨hal-00357955⟩