A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates |
| |
| Institution: | 1. IROI Srl, Salita S. Viale, Genova 16128, Italy;2. Department of Informatics, Bioengineering, Robotics and Systems Science, University of Genova, Via Opera Pia 13, Genova 16145, Italy |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
