A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion

Abstract

In this paper, we present a variable iterated greedy (vIGP-DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the differential evolution algorithm