A Tabu search Approach for the Weighted Tardiness with Sequence-Dependent Setups in one-machine Problem
Wedi'i Gadw mewn:
| Awdur: | |
|---|---|
| Fformat: | artículo original |
| Statws: | Versión publicada |
| Dyddiad Cyhoeddi: | 2002 |
| Disgrifiad: | In this paper, a Tabu Search Approach for the weighted tardiness single machine problem with sequence-dependent setups is proposed. The main contribution is the balance obtained between intensification and diversification strategies. The strategy of combine large step optimization, frequency-based memory, intensification by decomposition supplementing this with an additional intensification using path relinking produce good solutions with a low computational cost. Our Tabu Search approach is compared with a re-start method that employs the all-pairs neighborhood. Results of computational experiments are reported for a set of randomly generated test problems. |
| Gwlad: | Portal de Revistas UCR |
| Sefydliad: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Iaith: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/208 |
| Mynediad Ar-lein: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/208 |
| Allweddair: | Tabu Search scheduling problems weighted tardiness sequence depend- setups Búsqueda Tabú problemas de calendarización retardo ponderado puestas a punto que dependen de la sucesión |