Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778)

From MaRDI portal
Revision as of 16:56, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Worst-case analysis of an approximation algorithm for flow-shop scheduling
scientific article

    Statements

    Worst-case analysis of an approximation algorithm for flow-shop scheduling (English)
    0 references
    0 references
    0 references
    1989
    0 references
    worst-case analysis
    0 references
    m-machine permutation flow-shop problem
    0 references
    tight worst-case performance ratio
    0 references

    Identifiers