Improved heuristics for the n-job single-machine weighted tardiness problem

被引：24

作者：

Volgenant, A ^{[1
]}

Teerhuis, E ^{[1
]}

机构：

[1] Univ Amsterdam, Fac Econ Sci & Econ, Dept Operat Res, NL-1018 WB Amsterdam, Netherlands

来源：

COMPUTERS & OPERATIONS RESEARCH | 1999年 / 26卷 / 01期

关键词：

scheduling; weighted tardiness; heuristics;

D O I：

10.1016/S0305-0548(98)00048-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

For the n-job single-machine weighted tardiness problem a priority rule is known, that holds for neighboring jobs in an optimal solution. This rule is exploited as an improvement step for four construction heuristics. Computational results for a large number of test problems up to size 80 and various values of problem parameters show improved results, while the computing times on a standard personal computer remain modest. (C) 1998 Elsevier Science Ltd. All rights reserved.

引用

页码：35 / 44

页数：10

共 50 条

[21] An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
Deng, Guanlong
Gu, Xingsheng
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2014, 45 (03) : 351 - 362
[22] The single-machine total weighted tardiness scheduling problem with position-based learning effects
Yin, Yunqiang
Wu, Chin-Chia
Wu, Wen-Hsiang
Cheng, Shuenn-Ren
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (05) : 1109 - 1116
[23] The single-machine total tardiness scheduling problem: Review and extensions
Koulamas, Christos
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) : 1 - 7
[24] THE STOCHASTIC SINGLE-MACHINE SCHEDULING PROBLEM WITH EARLINESS AND TARDINESS COSTS
SOROUSH, HM
FREDENDALL, LD
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 77 (02) : 287 - 302
[25] Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics
Lin, Shih-Wei
Ying, Kuo-Ching
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 34 (11-12): : 1183 - 1190
[26] Decomposition of the single-machine total tardiness problem with a precedence constraint
Tanaka, S
Jouo, F
Araki, M
INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOL 1-4, PROCEEDINGS, 2005, : 716 - 721
[27] Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics
Shih-Wei Lin
Kuo-Ching Ying
The International Journal of Advanced Manufacturing Technology, 2007, 34 : 1183 - 1190
[28] HYBRID ALGORITHMS FOR THE EARLINESS{TARDINESS SINGLE-MACHINE MULTIPLE ORDERS PER JOB SCHEDULING PROBLEM WITH A COMMON DUE DATE
Rocholl, Jens
Moench, Lars
RAIRO-OPERATIONS RESEARCH, 2018, 52 (4-5) : 1329 - 1350
[29] The single-machine total tardiness problem with unequal release times and a linear deterioration
Wu, Chin-Chia
Cheng, Shuenn-Ren
Wu, Wen-Hsiang
Yin, Yunqiang
Wu, Wen-Hung
APPLIED MATHEMATICS AND COMPUTATION, 2013, 219 (20) : 10401 - 10415
[30] Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times
Wu, Chin-Chia
Hsu, Peng-Hsiang
Lai, Kunjung
JOURNAL OF MANUFACTURING SYSTEMS, 2011, 30 (01) : 54 - 62

← 1 2 3 4 5 →