Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups

TL;DR

This paper experimentally evaluates the effectiveness of an optimal recombination operator within a genetic algorithm for minimizing makespan in single-machine scheduling problems with sequence-dependent setup times, demonstrating practical benefits.

Contribution

It introduces and tests an optimal recombination operator specifically designed for the $1|s_{vu}|C_{ ext{max}}$ scheduling problem, showing its practical applicability.

Findings

Optimal recombination improves solution quality in experiments.

The approach is effective on benchmark problems from TSPLIB.

Recombination operator enhances genetic algorithm performance.

Abstract

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}$.