A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (Q1954823): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58911756, #quickstatements; #temporary_batch_1707216511891
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Omni-optimizer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/478981 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024954648 / 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: Job-shop scheduling with multi-purpose machines / 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: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization / 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: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental investigation of heuristics for resource-constrained project scheduling: an update / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid multiobjective genetic algorithm for robust resource-constrained project scheduling with stochastic durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty / 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
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: An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems / rank
 
Normal rank

Latest revision as of 12:55, 6 July 2024

scientific article
Language Label Description Also known as
English
A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
scientific article

    Statements

    A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2013
    0 references
    Summary: We address multiobjective flexible job-shop scheduling problem (FJSP) with three simultaneously considered objectives: minimizing makespan, minimizing total workload, and minimizing maximal workload. A hybrid multiobjective evolutionary approach (H-MOEA) is developed to solve the problem. According to the characteristic of FJSP, a modified crowding distance measure is introduced to maintain the diversity of individuals. In the proposed H-MOEA, well-designed chromosome representation and genetic operators are developed for FJSP. Moreover, a local search procedure based on critical path theory is incorporated in H-MOEA to improve the convergence ability of the algorithm. Experiment results on several well-known benchmark instances demonstrate the efficiency and stability of the proposed algorithm. The comparison with other recently published approaches validates that H-MOEA can obtain Pareto-optimal solutions with better quality and/or diversity.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references