Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups
This is an incremental improvement for scheduling optimization in operations research.
The paper tackled the makespan minimization problem on a single machine with sequence-dependent setup times by experimentally studying an optimal recombination operator in a genetic algorithm, and the computational experiment on benchmark problems indicated its practical applicability.
In this paper, we perform an experimental study of optimal recombination operator for makespan minimization problem on single machine with sequence-dependent setup times ($1|s_{vu}|C_{\max}$). The computational experiment on benchmark problems from TSPLIB library indicates practical applicability of optimal recombination in crossover operator of genetic algorithm for $1|s_{vu}|C_{\max}$.