An improved genetic algorithm for the flowshop scheduling problem (Q3596697): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A tabu search approach for the flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified simulated annealing algorithms for the flow shop sequencing problem / rank
 
Normal rank
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: A new constructive heuristic for the flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / 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 heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for the two-stage bicriteria flowshop problem / rank
 
Normal rank

Latest revision as of 01:10, 29 June 2024

scientific article
Language Label Description Also known as
English
An improved genetic algorithm for the flowshop scheduling problem
scientific article

    Statements

    An improved genetic algorithm for the flowshop scheduling problem (English)
    0 references
    29 January 2009
    0 references
    0 references
    0 references