An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colonies for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search heuristics for two-stage flow shop problems with secondary criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002567 / 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: Multiple and bicriteria scheduling: A literature survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for the two-stage bicriteria flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Flowshop Scheduling Problem with Bicriteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approach to the two-machine flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria two-machine permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00265-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997363303 / rank
 
Normal rank

Latest revision as of 08:33, 30 July 2024

scientific article
Language Label Description Also known as
English
An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
scientific article

    Statements

    An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 November 2002
    0 references
    Scheduling
    0 references
    Multiple objective programming
    0 references
    Ant Colony Optimization
    0 references

    Identifiers