| Article ID: | iaor20042610 |
| Country: | Netherlands |
| Volume: | 148 |
| Issue: | 3 |
| Start Page Number: | 591 |
| End Page Number: | 603 |
| Publication Date: | Aug 2003 |
| Journal: | European Journal of Operational Research |
| Authors: | Pridy Laurent, Pinson ric, Rivreau David |
| Keywords: | programming: branch and bound, programming: dynamic |
In this paper, we investigate the problem of minimizing the weighted number of late jobs on a single-machine with release dates. We show that a short-term scheduling memory approach can be used to strengthen a time-indexed Langrangean relaxation of the problem. A branch-and-bound algorithm using this lower bound is presented and computational experiments on problems with up to 100 jobs are reported.