Article ID: | iaor20083731 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 11 |
Start Page Number: | 3471 |
End Page Number: | 3490 |
Publication Date: | Nov 2007 |
Journal: | Computers and Operations Research |
Authors: | Paolucci Massimo, Anghinolfi Davide |
Keywords: | heuristics, heuristics: tabu search, optimization: simulated annealing, heuristics: local search |
This work proposes a hybrid metaheuristic (HMH) approach which integrates several features from tabu search, simulated annealing (SA) and variable neighbourhood search (VNS) in a new configurable scheduling algorithm. In particular, either a deterministic or a random candidate list strategy can be used to generate the neighbourhood of a solution, both a tabu list mechanism and the SA probabilistic rule can be adopted to accept solutions, and the dimension of the explored neighbourhood can be dynamically modified. The considered class of scheduling problems is characterized by a set of independent jobs to be executed on a set of parallel machines with non-zero ready times and sequence dependent setups. In particular, the NP-hard generalized parallel machine total tardiness problem recently defined by Bilge