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.
M. Iori, S. Martello (2008). Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems. BERLIN : Springer [10.1007/978-3-540-78985-7_2].
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems
MARTELLO, SILVANO
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.