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 条

[41] A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
Avolio, Matteo
Fuduli, Antonio
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2022, 10
[42] Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem
Russell, RM
Holsenback, JE
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (06) : 640 - 646
[43] BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
Valente, Jorge M. S.
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2009, 26 (03) : 319 - 339
[44] Algorithm for minimizing weighted earliness penalty in single-machine problem
Pathumnakul, S
Egbelu, PJ
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (03) : 780 - 796
[45] An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems
Maheswaran, R
Ponnambalam, SG
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 26 (9-10): : 1150 - 1156
[46] An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems
R. Maheswaran
S.G. Ponnambalam
The International Journal of Advanced Manufacturing Technology, 2005, 26 : 1150 - 1156
[47] Minimizing the weighted sum of squared tardiness on a single machine
Schaller, Jeffrey
Valente, Jorge M. S.
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (05) : 919 - 928
[48] A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios
Xuan, Gang
Lin, Win-Chin
Cheng, Shuenn-Ren
Shen, Wei-Lun
Pan, Po-An
Kuo, Chih-Ling
Wu, Chin-Chia
MATHEMATICS, 2022, 10 (13)
[49] A new heuristic for the n-job, m-machine flow-shop problem
Pour, HD
PRODUCTION PLANNING & CONTROL, 2001, 12 (07) : 648 - 653
[50] A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
Holthaus, O
Rajendran, C
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (08) : 947 - 953

← 1 2 3 4 5 →