Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57633907 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.mcm.2008.01.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2131135363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic constructive algorithms for open shop scheduling to minimize mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On The Complexity Of Openshop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling ordered open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Scheduling Problems Arising in Satellite Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling Finite Linear CSP into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and new heuristics for the open-shop problem: A computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive genetic algorithms for the open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with makespan and total completion time criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop scheduling with secondary criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the Open Shop to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of preemptive open-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total completion time open shop scheduling problem with a given sequence of jobs on one machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the open-shop problem with preemption and minimizing the average completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for shop scheduling problems with minsum objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank

Revision as of 18:51, 1 July 2024

scientific article
Language Label Description Also known as
English
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
scientific article

    Statements

    Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2009
    0 references
    open shop scheduling
    0 references
    mean flow time
    0 references
    metaheuristic algorithms
    0 references
    simulated annealing
    0 references
    genetic algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers