Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New heuristics for no-wait flowshops to minimize makespan. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MO-TRIBES, an adaptive multiobjective particle swarm optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to vehicle routing heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / 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 computational study of the permutation flow shop problem based on a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic Method for the Permutation Flow Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel hybrid heuristics for the permutation flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Efficiency of Tabu Search for Machine Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / 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: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5191184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm / rank
 
Normal rank

Latest revision as of 15:12, 8 July 2024

scientific article; zbMATH DE number 6305869
Language Label Description Also known as
English
Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
scientific article; zbMATH DE number 6305869

    Statements

    Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2014
    0 references
    flow-shop problem
    0 references
    scheduling
    0 references
    iterated local search
    0 references
    parallelizable algorithms
    0 references
    biased randomized heuristics
    0 references
    metaheuristics
    0 references
    parameters setting
    0 references
    0 references

    Identifiers