| Article ID: | iaor20042589 |
| Country: | United Kingdom |
| Volume: | 30 |
| Issue: | 12 |
| Start Page Number: | 1887 |
| End Page Number: | 1900 |
| Publication Date: | Oct 2003 |
| Journal: | Computers and Operations Research |
| Authors: | Bulfin R.L., M'Hallah Rym |
| Keywords: | programming: branch and bound |
In this paper, we describe an exact algorithm to solve the weighted number of tardy jobs two-machine flow shop scheduling problem. The algorithm uses branch-and-bound; a surrogate relaxation resulting in a multiple-choice knapsack provides the bounds. Extensive computational experiments indicate problems with 100 jobs can be solved quickly.