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 meta-heuristic 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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Iori, M., & Martello, S. (2008). Scatter search algorithms for identical parallel machine scheduling problems. Studies in Computational Intelligence, 128, 41–59. https://doi.org/10.1007/978-3-540-78985-7_2
Mendeley helps you to discover research relevant for your work.