A genetic algorithm for flowshop sequencing (Q1342312): 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: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / 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: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Heuristic for the Quadratic Assignment Problem / 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: Benchmarks for basic scheduling problems / rank
 
Normal rank

Latest revision as of 11:22, 23 May 2024

scientific article
Language Label Description Also known as
English
A genetic algorithm for flowshop sequencing
scientific article

    Statements

    A genetic algorithm for flowshop sequencing (English)
    0 references
    0 references
    13 February 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    genetic algorithms
    0 references
    simulated annealing
    0 references
    makespan
    0 references
    \(n\)-job, \(m\)-machine permutation flowshop sequencing
    0 references