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.
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem / A. GROSSO; DELLA CROCE DI DOJOLA F.; R. TADEI. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - 32(2004), pp. 68-72.
Titolo: | An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem |
Autori: | |
Data di pubblicazione: | 2004 |
Rivista: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/S0167-6377(03)00064-6 |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
10046_UPLOAD.pdf | Altro materiale allegato | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/1399396