Fast neighborhood search for the single machine total weighted tardiness problem

被引：14
|
作者：
Ergun, Ö [1 ]
Orlin, JB
机构：
[1] Georgia Inst Technol, Atlanta, GA 30332 USA
[2] MIT, Alfred P Sloan Sch Management, Cambridge, MA 02139 USA
来源：
OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 01期
基金：
美国国家科学基金会;
关键词：
neighborhood search; single machine scheduling; algorithms;
D O I：
10.1016/j.orl.2005.01.010
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Most successful heuristics for solving 1 parallel to Sigma w(j)T(j) are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n(3))to O(n(2)). We show that this result also improves the complexity of the recently developed dynasearch heuristics. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：41 / 45
页数：5
相关论文
共 50 条
12345