A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473)

From MaRDI portal
Revision as of 04:44, 3 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 an arbitrary number of parallel two-stage flow-shops
scientific article

    Statements

    A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2019
    0 references
    scheduling
    0 references
    parallel two-stage flow-shops
    0 references
    makespan
    0 references
    mixed integer program
    0 references
    polynomial-time approximation scheme
    0 references

    Identifiers