A new particle swarm optimization for the open shop scheduling problem (Q2482375): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: David Y. Sha / rank
Normal rank
 
Property / author
 
Property / author: David Y. Sha / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Beam-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.2007.02.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044907449 / 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: Classical and new heuristics for the open-shop problem: A computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the open shop scheduling 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 tabu search algorithm for the open shop scheduling 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: Non‐greedy heuristics and augmented neural networks for 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: 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
Property / cites work
 
Property / cites work: A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the job shop scheduling problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:39, 27 June 2024

scientific article
Language Label Description Also known as
English
A new particle swarm optimization for the open shop scheduling problem
scientific article

    Statements

    A new particle swarm optimization for the open shop scheduling problem (English)
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    particle swarm optimization
    0 references
    open shop scheduling
    0 references

    Identifiers