An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128076005, #quickstatements; #temporary_batch_1723839584858
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: weightedHypervolume / 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.1016/j.cor.2019.04.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2938448575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms / 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: A research survey: review of flexible job shop scheduling techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-resource shop scheduling with resource flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search with path relinking for the flexible job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-relinking tabu search for the multi-objective flexible job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128076005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:23, 16 August 2024

scientific article
Language Label Description Also known as
English
An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
scientific article

    Statements

    An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (English)
    0 references
    8 July 2019
    0 references
    0 references
    flexible job-shop scheduling
    0 references
    multi-objective
    0 references
    regular criteria
    0 references
    Pareto optimization
    0 references
    local search
    0 references
    0 references
    0 references