EU/ME - the metaheuristics community

  • Increase font size
  • Default font size
  • Decrease font size
Home Metaheuristics articles Recent Publications Computers & OR 39(6), 2012

Computers & OR 39(6), 2012

E-mail Print PDF

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

by F. Della Croce, T. Garaix and A. Grosso

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.

Keywords: Scheduling; Tardiness; Parallel machines; Very large neighborhood

Read this article now.

@article{dellacroce.garaix.ea:12,
  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"
}

Last Updated on Monday, 10 October 2011 08:10  

Newsflash

EU/ME 2017

Submit now your abstract.

Metaheuristics Events

<<  March 2017  >>
 Mo  Tu  We  Th  Fr  Sa  Su 
    1  2  3  4  5
  6  7  8  9101112
13141516171819
202526
2728293031  

Who's Online

We have 52 guests online