Fast neighborhood search for the single machine total weighted tardiness problem |
| |
| Authors: | Ö zlem Ergun,James B. Orlin |
| |
| Affiliation: | a Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
b Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA |
| |
| Abstract: | Most successful heuristics for solving 1||∑wjTj 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. |
| |
| Keywords: | Neighborhood search Single machine scheduling Algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
