17 citations · 44 across the 17 of their papers we have counts for
3 papers · 1 filter
Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups
A. V. Eremeev, Ju. V. Kovalenko
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}…
Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem
Pavel A. Borisovsky, Anton V. Eremeev, Josef Kallrath
In this paper, we develop a new formulation of changeover constraints for mixed integer programming problem (MIP) that emerges in solving a short-term production scheduling problem…
Level-based Analysis of Genetic Algorithms and other Search Processes
Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev +1
Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evol…