We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing metaheuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insights in the development of this heuristic technique, and discuss the combinatorial difficulties of the problems through the analysis of extensive computational results.
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems / Iori, Manuel; S., Martello. - STAMPA. - 128:(2008), pp. 41-59. [10.1007/978-3-540-78985-7_2]
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems
IORI, MANUEL;
2008
Abstract
We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing metaheuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insights in the development of this heuristic technique, and discuss the combinatorial difficulties of the problems through the analysis of extensive computational results.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
