On complexity of optimal recombination for flowshop scheduling problems

DOI10.1134/S1990478916020071zbMath1349.90444MaRDI QIDQ3186862

Julia Viktorovna Kovalenko

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutationgenetic algorithmflow shop problemoptimal recombination

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The use of dynamic programming in genetic algorithms for permutation problems
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• The algebra of genetic algorithms
• Tour Merging via Branch-Decomposition
• Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I
• Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: On complexity of optimal recombination for flowshop scheduling problems