Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127121660, #quickstatements; #temporary_batch_1723667127323
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: irace / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2980010855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Methods for the Analysis of Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for Solving the Multi-Processor Flow-Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manufacturing Scheduling Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling research after five decades / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding strategies for the hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParamILS: An Automatic Algorithm Configuration Framework / 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: SATenstein: automatically building local search SAT solvers from components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics—the metaphor exposed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5191184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127121660 / rank
 
Normal rank

Latest revision as of 21:36, 14 August 2024

scientific article
Language Label Description Also known as
English
Automatic algorithm design for hybrid flowshop scheduling problems
scientific article

    Statements

    Automatic algorithm design for hybrid flowshop scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2020
    0 references
    scheduling
    0 references
    hybrid flowshop
    0 references
    automatic algorithm configuration
    0 references
    automatic algorithm design
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers