On complexity of optimal recombination for one scheduling problem with setup times
From MaRDI portal
Publication:5263771
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)