| Article ID: | iaor19911297 |
| Country: | Switzerland |
| Volume: | 24 |
| Start Page Number: | 189 |
| End Page Number: | 195 |
| Publication Date: | Jul 1990 |
| Journal: | Annals of Operations Research |
| Authors: | Tang Guochun . |
In this paper, the problem of sequencing jobs on a single machine to minimize the weighted number of tardy jobs is considered. Some new dominances between jobs are proposed and studied. A new branch and bound algorithm that can solve large problems, e.g. 85 jobs, is presented.