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 条
  • [1] An improved heuristic for the single-machine, weighted-tardiness problem
    Holsenback, JE
    Russell, RM
    Markland, RE
    Philipoom, PR
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (04): : 485 - 495
  • [2] Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
    Valente, Jorge M. S.
    Schaller, Jeffrey E.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2223 - 2231
  • [3] Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
    Rostami, Salim
    Creemers, Stefan
    Leus, Roel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (01) : 43 - 49
  • [4] A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM
    Nearchou, Andreas C.
    CYBERNETICS AND SYSTEMS, 2012, 43 (08) : 651 - 668
  • [5] A hybrid evolutionary approach for the single-machine total weighted tardiness problem
    Ding, Junwen
    Lu, Zhipeng
    Cheng, T. C. E.
    Xu, Liping
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 108 : 70 - 80
  • [6] A HEURISTIC FOR THE SINGLE-MACHINE TARDINESS PROBLEM
    PANWALKAR, SS
    SMITH, ML
    KOULAMAS, CP
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 70 (03) : 304 - 310
  • [7] Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem
    Federico Della Croce
    Andrea Grosso
    Vangelis Th. Paschos
    Journal of Scheduling, 2004, 7 : 85 - 91
  • [8] Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
    Della Croce, F
    Grosso, A
    Paschos, VT
    JOURNAL OF SCHEDULING, 2004, 7 (01) : 85 - 91
  • [9] ALGORITHMS FOR A CLASS OF SINGLE-MACHINE WEIGHTED TARDINESS AND EARLINESS PROBLEMS
    YANO, CA
    KIM, YD
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 52 (02) : 167 - 178
  • [10] Parallel Algorithm with Blocks for a Single-Machine Total Weighted Tardiness Scheduling Problem
    Uchronski, Mariusz
    APPLIED SCIENCES-BASEL, 2021, 11 (05): : 1 - 17
12345