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

Authors:
F. Della Croce;T. Garaix;A. Grosso
Affiliations:
DAI, Politecnico di Torino, Italy;DAI, Politecnico di Torino, Italy;Dip. di Informatica, Universití di Torino, Italy
Venue:
Computers and Operations Research
Year:
2012

Citing 10
Cited 0

Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
A tabu search algorithm for parallel machine total tardiness problem

Computers and Operations Research
Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

Computers and Operations Research
On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

Mathematical Programming: Series A and B
Time-Indexed Formulations and the Total Weighted Tardiness Problem

INFORMS Journal on Computing
An exact algorithm for single-machine scheduling without machine idle time

Journal of Scheduling
Fast neighborhood search for the single machine total weighted tardiness problem

Operations Research Letters
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present computational results with a heuristic algorithm for the parallel machines total weighted tardiness problem. The algorithm combines generalized pairwise interchange neighborhoods, dynasearch optimization and a new machine-based neighborhood whose size is non-polynomial in the number of machines. The computational results significantly improve over the current state of the art for this problem.