Improved genetic algorithm for the permutation flowshop scheduling problem. (Q1427101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3607719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank

Revision as of 14:20, 6 June 2024

scientific article
Language Label Description Also known as
English
Improved genetic algorithm for the permutation flowshop scheduling problem.
scientific article

    Statements

    Improved genetic algorithm for the permutation flowshop scheduling problem. (English)
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Genetic algorithms
    0 references
    Permutation flowshop scheduling
    0 references
    Longest common subsequence
    0 references
    Design of experiments
    0 references

    Identifiers