Fitness landscapes for the Total Tardiness Single Machine Scheduling problem

We address several issues related to the approximate solution of the Single Machine Scheduling problem with sequence-dependent setup times using metaheuristic methods. Instances with known optimal solution are solved using a Memetic Algorithm and a Multiple Start approach. A fitness landscape analysis is also conducted on a subset of the instances to understand the different performances of the two approaches. We present a novel way to create instances with known optimal solutions from optimally solved ATSP instances. Finally we argue for the test set of instances to be used in future works as a convenient performance benchmark.