Article ID Journal Published Year Pages File Type
1143455 Operations Research Letters 2006 5 Pages PDF
Abstract

Most successful heuristics for solving 1||∑wjTj1||∑wjTj are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n3)O(n3) to O(n2)O(n2). We show that this result also improves the complexity of the recently developed dynasearch heuristics.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Fast neighborhood search for the single machine total weighted tardiness problem
Authors
, ,