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
关键词
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] Improved heuristics for the n-job single-machine weighted tardiness problem
    Volgenant, A.
    Teerhuis, E.
    Computers and Operations Research, 1999, 26 (01): : 35 - 44
  • [2] 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
  • [3] Meta-heuristics for the single-machine scheduling total weighted tardiness problem
    Madureira, Ana Maria
    Proceedings of the IEEE International Symposium on Assembly and Task Planning, 1999, : 405 - 410
  • [4] SINGLE-MACHINE TARDINESS SEQUENCING HEURISTICS
    POTTS, CN
    VANWASSENHOVE, LN
    IIE TRANSACTIONS, 1991, 23 (04) : 346 - 354
  • [5] 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
  • [6] AIT-S for Single-Machine Weighted Tardiness Problem
    Petrynski, Kacper
    Pozniak-Koszalka, Iwona
    Koszalka, Leszek
    Kasprzak, Andrzej
    VIETNAM JOURNAL OF COMPUTER SCIENCE, 2019, 6 (03) : 273 - 284
  • [7] A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM
    Nearchou, Andreas C.
    CYBERNETICS AND SYSTEMS, 2012, 43 (08) : 651 - 668
  • [8] 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
  • [9] 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
  • [10] A SURVEY OF ALGORITHMS FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS SCHEDULING PROBLEM
    ABDULRAZAQ, TS
    POTTS, CN
    VANWASSENHOVE, LN
    DISCRETE APPLIED MATHEMATICS, 1990, 26 (2-3) : 235 - 253