Fast neighborhood search for the single machine total weighted tardiness problem

Authors:
ÖZlem Ergun;James B. Orlin
Affiliations:
Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA;Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Venue:
Operations Research Letters
Year:
2006

Citing 3
Cited 5

An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
New neighborhood search algorithms based on exponentially large neighborhoods

New neighborhood search algorithms based on exponentially large neighborhoods
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

Operations Research Letters

Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Computers and Operations Research
Technical Note: A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time"

Computers and Industrial Engineering
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Computers and Operations Research
Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups

Theoretical Computer Science
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most successful heuristics for solving 1||@?w"jT"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.