On the Single-machine Scheduling Problem with Tardiness Penalties |
| |
Authors: | Tapan Sen Bolindra N. Borah |
| |
Affiliation: | 1.University of Tennessee,Chattanooga;2.North Carolina A and T State University,Greensboro |
| |
Abstract: | The n-job, single-machine total tardiness problem is considered in this paper. A branching algorithm based on three theorems is proposed to generate a reduced set of candidate sequences. The computational results indicate that the proposed algorithm provides a smaller set of candidate sequences than the DP algorithm of Schrage and Baker. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |