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 条
  • [21] ON POLYNOMIAL SOLVABILITY OF THE HIGH MULTIPLICITY TOTAL WEIGHTED TARDINESS PROBLEM
    GRANOT, F
    SKORINKAPOV, J
    DISCRETE APPLIED MATHEMATICS, 1993, 41 (02) : 139 - 146
  • [22] Single machine total weighted tardiness problem with genetic algorithms
    Ferrolho, Antonio
    Crisostomo, Manuel
    2007 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2, 2007, : 1 - +
  • [23] Time-indexed formulations and the total weighted tardiness problem
    Bigras, Louis-Philippe
    Gamache, Michel
    Savard, Gilles
    INFORMS JOURNAL ON COMPUTING, 2008, 20 (01) : 133 - 142
  • [24] Improved heuristics for the n-job single-machine weighted tardiness problem
    Volgenant, A.
    Teerhuis, E.
    Computers and Operations Research, 1999, 26 (01): : 35 - 44
  • [25] Improved heuristics for the n-job single-machine weighted tardiness problem
    Volgenant, A
    Teerhuis, E
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (01) : 35 - 44
  • [26] Fast neighborhood search for the single machine total weighted tardiness problem
    Ergun, Ö
    Orlin, JB
    OPERATIONS RESEARCH LETTERS, 2006, 34 (01) : 41 - 45
  • [27] A NOTE ON THE WEIGHTED TARDINESS PROBLEM
    RACHAMADUGU, RMV
    OPERATIONS RESEARCH, 1987, 35 (03) : 450 - 452
  • [28] New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation
    Talens, Carla
    Valente, Jorge M. S.
    Fernandez-Viagas, Victor
    COMPUTERS & OPERATIONS RESEARCH, 2024, 172
  • [29] THE WEIGHTED TOTAL TARDINESS PROBLEM WITH FIXED SHIPPING TIMES AND OVERTIME UTILIZATION
    MATSUO, H
    OPERATIONS RESEARCH, 1988, 36 (02) : 293 - 307
  • [30] Breakout dynasearch for the single-machine total weighted tardiness problem
    Ding, Junwen
    Lu, Zhipeng
    Cheng, T. C. E.
    Xu, Liping
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 98 : 1 - 10
12345