Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
by F. Della Croce, T. Garaix and A. Grosso
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.
Keywords: Scheduling; Tardiness; Parallel machines; Very large neighborhood
Read this article now.
title = "Iterated local search and very large neighborhoods for the
parallel-machines total tardiness problem",
journal = "Computers & Operations Research",
author = "F. Della Croce and T. Garaix and A. Grosso",
volume = "39",
number = "6",
pages = "1213 - 1217",
year = "2012",
doi = "10.1016/j.cor.2010.10.017"