On complexity of optimal recombination for flowshop scheduling problems

DOI10.1134/S1990478916020071MaRDI QIDQ3186862zbMATH OpenFDO

Authors Julia Viktorovna Kovalenko

Publication date 12 August 2016

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

Full work available at URL https://doi.org/10.1134/S1990478916020071

zbMATH Keywords

flow shop problemgenetic algorithmoptimal recombinationpermutation

Mathematics Subject Classification ID

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

Recommendations

• On complexity of optimal recombination for one scheduling problem with setup times
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• The complexity of the optimal recombination for the traveling salesman problem
• scientific article; zbMATH DE number 3860868

Cites work

• scientific article; zbMATH DE number 6007914 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 4101220 (Why is no real title available?)
• scientific article; zbMATH DE number 3746841 (Why is no real title available?)
• scientific article; zbMATH DE number 41713 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Introduction to algorithms
• On complexity of optimal recombination for one scheduling problem with setup times
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• The algebra of genetic algorithms
• The use of dynamic programming in genetic algorithms for permutation problems
• Tour merging via branch-decomposition

Cited in

(7)

• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• The complexity of the optimal recombination for the traveling salesman problem
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
• On complexity of optimal recombination for one scheduling problem with setup times
• About one approach to solving the problem of fuzzy recombination
• Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem

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

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