ON THE SINGLE-MACHINE SCHEDULING PROBLEM WITH TARDINESS PENALTIES

被引:8
|
作者
SEN, T [1 ]
BORAH, BN [1 ]
机构
[1] N CAROLINA AGR & TECHNOL STATE UNIV,GREENSBORO,NC 27411
关键词
BRANCH-AND-BOUND; SINGLE-MACHINE SCHEDULING; TOTAL TARDINESS;
D O I
10.2307/2583788
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:695 / 702
页数:8
相关论文
共 50 条