1. Fitness landscapes for the total tardiness single machine scheduling problem
- Creator:
- Mendes, Alexandre S., Franca, Paulo M., and Moscato, Pablo
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- genetic algorithms, memetic algorithms, fitness landscapes, machine scheduling, and combinatorial optimization
- Language:
- English
- Description:
- This páper addresses several issues related to the approximate solution of the Single Machine Scheduling problém 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 instances to understand the behavior of the two approaches during the optimization process. We also present a novel way to create instances with known optimal Solutions from the optimally solved asymmetric travelling salesman problém (ATSP) instances. Finally we argue for the test set of instances to be ušed in future works as a convenient performance benchmark.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public