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.
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
GROSSO, Andrea Cesare
2012-01-01
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
deroga.pdf
Accesso riservato
Tipo di file:
DEROGA (OBBLIGATORIO ALLEGARE FILE CON MOTIVAZIONE)
Dimensione
22.91 kB
Formato
Adobe PDF
|
22.91 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
