New constructive heuristics for the total weighted tardiness problem

被引：8
|
作者：
Yoon, S. H. [2 ]
Lee, I. S. [1 ]
机构：
[1] Dong A Univ, Sch Business, Pusan 604714, South Korea
[2] Yeungnam Univ, Seoul, South Korea
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2011年 / 62卷 / 01期
关键词：
single-machine scheduling; total weighted tardiness; constructive heuristics; JOB SHOPS; MINIMIZE;
D O I：
10.1057/jors.2009.186
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This note considers the single-machine total weighted tardiness problem. Three new heuristic algorithms are suggested and compared with other competing heuristics from the literature, such as Apparent Tardiness Cost, Weighted Covert and Weighted Modified Due Date. The experimental tests show that the suggested heuristic algorithms outperform the existing heuristics. Journal of the Operational Research Society (2011) 62, 232-237. doi:10.1057/jors.2009.186 Published online 24 February 2010
引用
下载
收藏
页码：232 / 237
页数：6
相关论文
共 50 条
12345