Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Beam-ACO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HC-ACO / 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.2003.11.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029319864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search and Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / 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: Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / 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: A new lower bound for the open-shop problem / rank
 
Normal rank

Revision as of 17:38, 7 June 2024

scientific article
Language Label Description Also known as
English
Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
scientific article

    Statements

    Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (English)
    0 references
    0 references
    22 February 2005
    0 references
    Ant colony optimization
    0 references
    Beam search
    0 references
    Tree search
    0 references
    Open shop scheduling
    0 references
    0 references
    0 references
    0 references

    Identifiers