An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

被引：47

作者：

Grosso, A

Della Croce, F

Tadei, R

机构：

[1] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy

[2] Politecn Torino, Dipartimento Automat & Informat, I-10129 Turin, Italy

来源：

OPERATIONS RESEARCH LETTERS | 2004年 / 32卷 / 01期

关键词：

total weighted tardiness; dynasearch; generalized pairwise interchanges;

D O I：

10.1016/S0167-6377(03)00064-6

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Based on the work by Congram, Potts and Van de Velde, we develop for the single-machine total weighted tardiness scheduling problem an enhanced dynasearch neighborhood obtained by the generalized pairwise interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results significantly improve over those of Congram, Potts and Van de Velde. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：68 / 72

页数：5

共 6 条

[1] An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem [J].