A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393)

From MaRDI portal
Revision as of 23:15, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an 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 the two machine flow shop problem with several availability constraints
scientific article

    Statements

    A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (English)
    0 references
    0 references
    30 November 2012
    0 references
    flow shop
    0 references
    scheduling
    0 references
    availability constraint
    0 references
    approximation scheme
    0 references

    Identifiers