| Article ID: | iaor20052533 |
| Country: | Netherlands |
| Volume: | 158 |
| Issue: | 3 |
| Start Page Number: | 595 |
| End Page Number: | 608 |
| Publication Date: | Nov 2004 |
| Journal: | European Journal of Operational Research |
| Authors: | Carlier Jacques, Baptiste Philippe, Jouglet Antoine |
| Keywords: | programming: branch and bound |
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.