A new branch and bound algorithm for minimizing the weighted number of tardy jobs |
| |
| Authors: | Guochun Tang |
| |
| Institution: | (1) Shanghai Second Polytechnic University, Shanghai, P.R. China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
