On complexity of optimal recombination for one scheduling problem with setup times

MaRDI QIDQ5263771zbMATHFDO

Authors Anton Valentinovich Eremeev, Julia Viktorovna Kovalenko

Publication date 17 July 2015

Full work available at URL http://mathnet.ru/eng/da687

zbMATH Keywords

genetic algorithmschedulingsetup timeoptimal recombination

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Recommendations

• On complexity of optimal recombination for flowshop scheduling problems
• The complexity of the optimal recombination for the traveling salesman problem
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• The computational complexities of two multi-purpose machines scheduling problem with setup times

Cited in

(6)

• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• The complexity of the optimal recombination for the traveling salesman problem
• About one approach to solving the problem of fuzzy recombination
• Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• On complexity of optimal recombination for flowshop scheduling problems

This page was built for publication: On complexity of optimal recombination for one scheduling problem with setup times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263771)