A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605)

From MaRDI portal
Revision as of 04:27, 7 August 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
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
scientific article

    Statements

    A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    parallel two-stage flowshops
    0 references
    makespan constraint
    0 references
    polynomial-time approximation scheme
    0 references
    multiple knapsacks
    0 references
    rounding
    0 references

    Identifiers