Iterated greedy algorithms for a complex parallel machine scheduling problem

•Development of Iterated Greedy algorithms to solve a complex scheduling problem.•Combination of different destroy and repair operators.•Combined use of different diversification and intensification strategies.•New set of instances, based on several generation processes in the literature.•Improved performance compared to other algorithms to solve the addressed problem.