On complexity of optimal recombination for flowshop scheduling problems (Q3186862): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5263771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebra of genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of dynamic programming in genetic algorithms for permutation problems / rank
 
Normal rank

Latest revision as of 10:07, 12 July 2024

scientific article
Language Label Description Also known as
English
On complexity of optimal recombination for flowshop scheduling problems
scientific article

    Statements

    On complexity of optimal recombination for flowshop scheduling problems (English)
    0 references
    12 August 2016
    0 references
    flow shop problem
    0 references
    permutation
    0 references
    genetic algorithm
    0 references
    optimal recombination
    0 references

    Identifiers