Fast neighborhood search for the single machine total weighted tardiness problem

Fast neighborhood search for the single machine total weighted tardiness problem

0.00 Avg rating—0 Votes
Article ID: iaor20061706
Country: Netherlands
Volume: 34
Issue: 1
Start Page Number: 41
End Page Number: 45
Publication Date: Jan 2006
Journal: Operations Research Letters
Authors: ,
Keywords: combinatorial analysis, heuristics
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.