Archivio Istituzionale della RicercaBased on the work by Congram, Potts and Van de Velde, we develop for the single-machine total weighted tardiness scheduling problem an enhanced dynasearch neighborhood obtained by the generalized pairwise interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results significantly improve over those of Congram, Potts and Van de Velde.
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem / A., Grosso; DELLA CROCE DI DOJOLA, Federico; Tadei, Roberto. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - 32:(2004), pp. 68-72. [10.1016/S0167-6377(03)00064-6]
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
DELLA CROCE DI DOJOLA, Federico;TADEI, Roberto
2004
Abstract
Based on the work by Congram, Potts and Van de Velde, we develop for the single-machine total weighted tardiness scheduling problem an enhanced dynasearch neighborhood obtained by the generalized pairwise interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results significantly improve over those of Congram, Potts and Van de Velde.
| File | Dimensione | Formato | |
|---|---|---|---|
|
10046_UPLOAD.pdf
non disponibili
Tipologia:
Altro materiale allegato
Licenza:
Non Pubblico - Accesso privato/ristretto
Dimensione
217.54 kB
Formato
Adobe PDF
|
217.54 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1399396
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo