Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970867026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and scheduling in a flexible job shop by tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS / 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: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved harmony search algorithm for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global-best harmony search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the flexible job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem / rank
 
Normal rank

Latest revision as of 10:15, 13 July 2024

scientific article
Language Label Description Also known as
English
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
scientific article

    Statements

    Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (English)
    0 references
    0 references
    0 references
    8 February 2017
    0 references
    flexible job shop scheduling
    0 references
    harmony search algorithm
    0 references
    multi-objective optimization
    0 references
    local search
    0 references

    Identifiers