A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (Q4849290)

From MaRDI portal
Revision as of 19:46, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 800657
Language Label Description Also known as
English
A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
scientific article; zbMATH DE number 800657

    Statements

    A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 1995
    0 references
    0 references
    computational analysis
    0 references
    branch-and-bound
    0 references
    two-machine flow shop scheduling
    0 references
    simulated annealing
    0 references
    tabu search
    0 references
    genetic algorithms
    0 references